#include <algorithm>
#include <iostream>
using namespace std;
typedef pair<int, int> P;

int main()
{
    int n;
    cin >> n;
    int r[100005];
    for(int i = 0; i < n; i++) cin >> r[i];
    int last = r[0];
    int rmax = r[0];
    int ans = 1;
    for(int i = 1; i < n; i++){
        if(last <= i){
            last = rmax;
            ans++;
        }
        rmax = max(rmax, r[i]);
    }
    cout << ans << endl;
}