//Just try and the idea will come!
#include<bits/stdc++.h>
using namespace std;
int mx,n,i,a[1000001],ans,tree[4000004];
void update(int v,int l,int r,int pos,int val){
if(l==pos&&r==pos){
tree[v]=val;
return;
}
int mid=(l+r)>>1;
if(pos<=mid)update((v*2),l,mid,pos,val);
else update((v*2)+1,mid+1,r,pos,val);
tree[v]=min(tree[(v*2)],tree[(v*2)+1]);
}
int get(int v,int l,int r,int ql,int qr){
if(ql<=l&&r<=qr)return tree[v];
if(r<ql||qr<l)return 1000001;
int mid=(l+r)>>1;
return min(get((v*2),l,mid,ql,qr),get((v*2)+1,mid+1,r,ql,qr));
}
main(){
for(i=0;i<4000004;i++)tree[i]=1000001;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
i=0;
while(i<n){
mx=get(1,1,1000001,a[i]+1,1000001);
update(1,1,1000001,a[i],a[i]);
while(i+1<n&&a[i]<=a[i+1]&&a[i+1]<=mx)i++,update(1,1,1000001,a[i],a[i]);;
i++;
ans++;
}
printf("%d",ans);
}
