#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> v(n + 1), next_value(n + 1);
    vector<pair<int, int> > v2;
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
        v2.push_back(make_pair(v[i], i));
        if(v[i] > 1) {
            next_value[v[i] - 1] = i;
        }
    }
    sort(v2.begin(), v2.end());
    int rounds = 1;
    for(int i = 1; i < n; i++) {
        if(next_value[i] < v2[i - 1].second) {
            ++rounds;
        }
    }
    cout << rounds << endl;
    return 0;
}