#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

int n;

int a[+];

int Min[+];

int ans;

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++) scanf("%d",&a[i]);

    Min[n]=a[n]; Min[n+]=1e9+;

    for(int i=n-;i>=;i--) Min[i]=min(Min[i+],a[i]);

    int pre=-;

    for(int i=;i<=n;i++)

    {

        pre=max(pre,a[i]);

        if(pre<=Min[i+])

        {

            ans++;

            pre=-;

        }

    }

    printf("%d\n",ans);

    return ;

}