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

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T> using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;


void solve() {
    o_set<pair<int, int>> st;
    int n;
    cin >> n;
    vector<int> v(n);
    vector<bool> mark(n);
    for(auto &x: v) 
        cin >> x;
    for(int i = 0; i < n; i++) {
        int cnt = st.order_of_key({v[i] + 1, 0});
        if(cnt >= v[i]) mark[i] = 1;
        st.insert({v[i], i});
    }
    st.clear();
    for(int i = n - 1; i >= 0; i--) {
        int cnt = (n - i) - st.order_of_key({v[i], 0});
        if(cnt >= v[i]) mark[i] = 1;
        st.insert({v[i], i});
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        if(mark[i]) ans++;
    }
    cout << ans << '\n';
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc = 1;
    // cin >> tc;
    for(int kase = 1; kase <= tc; kase++) {
        //cout << "Case " << kase << ": ";
        solve();
    }
    return 0;
}