#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353;
typedef pair<int,int> pi;
int a[N],b[N];
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];
    sort(b+1,b+1+n);
    map<int,int>mp,mp1;
    for(int i=1;i<=n;i++)mp[b[i]]=i;
    for(int i=1;i<=n;i++)a[i]=mp[a[i]];
    queue<pi>q;
    for(int i=1;i<=n;i++)
    {
        if(i<=a[i])
        {
            q.push({i,a[i]});
            //cout<<i<<' '<<a[i]<<'\n';
        }
    }
    int ans=1;
    int ll=1,rr=q.front().second;
    q.pop();
    while(q.size())
    {
        int l=q.front().first,r=q.front().second;
        q.pop();
        if(l>rr)
        {
            ans++;
            ll=l,rr=r;
        }
        else rr=r;
    }
    cout<<ans;
}
signed main()
{
    io;
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}