#include<cstdio>
#include<algorithm>
#include<vector>
#define N 200005
#define INF 0x3fffffff
using namespace std;
int n;
pair<int, int>a[N];
vector<int>p[N];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i].first);
        a[i].second = i;
    }
    sort(a + 1, a + 1 + n);
    int t = 0;
    for (int i = 1; i <= n; i++)
    {
        p[++t].push_back(a[i].second);
        while (a[i].first == a[i + 1].first) p[t].push_back(a[++i].second);
    }
    for (int i = 1; i <= t; i++) sort(p[i].begin(), p[i].end());
    bool flag = 0;
    int num = INF, ans = 1;
    for (int i = 1; i <= t; i++)
    {
        int s = p[i].size();
        if (flag) {
            if (num < p[i][0]) num = p[i][s - 1];
            else {
                ++ans;
                flag = 0;
                num = p[i][0];
            }
        }
        else {
            if (num > p[i][s - 1]) num = p[i][0];
            else {
                flag = 1;
                num = p[i][s - 1];
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}