#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
const int N = 1e6 + 10;


int n, a[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];
    
    set<int> s;
    s.insert(N);
    int ans = 1;
    for(int i = 2, l = 1, ub = N; i <= n; i ++) {
        if(a[i] < a[i - 1] || a[i] > ub) {
            while(l < i) {
                s.insert(a[l]);
                l ++;
            }
            ub = *s.upper_bound(a[i]);
            ans ++;
        }
    }
    cout << ans << "\n";
}