#include <bits/stdc++.h>

using namespace std;
# define ll long long
# define inf 1000000000
const ll mod = 1000000007;
const double pi = 3.141592653589793;

inline int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }

inline int lcm(int n, int m) { return n * m / gcd(n, m); }

ll powmod(ll a, ll b) {
    ll res = 1;
    a %= mod;
    for (; b; b >>= 1) {
        if (b & 1)res = res * a % mod;
        a = a * a % mod;
    }
    return res;
}

int n;
struct A{
    int id,v;
    bool operator <(const A &a)const {
        if(a.v==v)return id<a.id;
        return v<a.v;
    }
}a[1000010];
int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i].v);
        a[i].id=i;
    }
    sort(a+1,a+1+n);
    int ans=0,now=0;
    for(int i=1;i<=n;i++){
        if(a[i].id<now)continue;
        now=a[i].id;
        ans++;
    }
    printf("%d",ans);
}