#include <bits/stdc++.h>
using namespace std;
 
const int MaxN=1e6;
const int MaxA=1e9;
int N;
int num[MaxN];
int pos[MaxN];
bool comp(int lhs, int rhs){
	return (num[lhs]!=num[rhs])?num[lhs]<num[rhs]:lhs<rhs;
}
int main() {
	ios::sync_with_stdio(0);//加速讀取
	cin.tie(0); cout.tie(0);
 
	cin>>N;
	for(int n=0;n<N;n++)
	  cin>>num[n];
	iota(pos,pos+N,0);
	sort(pos,pos+N,comp);
	int ans=0;
	int pvt=-1;//最遠的位置
	for(int n=0;n<N;n++){
		pvt=max(pvt,pos[n]);//回家看
		ans+=n==pvt;
	}
	cout<<ans;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgTWF4Tj0xZTY7CmNvbnN0IGludCBNYXhBPTFlOTsKaW50IE47CmludCBudW1bTWF4Tl07CmludCBwb3NbTWF4Tl07CmJvb2wgY29tcChpbnQgbGhzLCBpbnQgcmhzKXsKCXJldHVybiAobnVtW2xoc10hPW51bVtyaHNdKT9udW1bbGhzXTxudW1bcmhzXTpsaHM8cmhzOwp9CmludCBtYWluKCkgewoJaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7Ly/liqDpgJ/oroDlj5YKCWNpbi50aWUoMCk7IGNvdXQudGllKDApOwoJCgljaW4+Pk47Cglmb3IoaW50IG49MDtuPE47bisrKQoJICBjaW4+Pm51bVtuXTsKCWlvdGEocG9zLHBvcytOLDApOwoJc29ydChwb3MscG9zK04sY29tcCk7CglpbnQgYW5zPTA7CglpbnQgcHZ0PS0xOy8v5pyA6YGg55qE5L2N572uCglmb3IoaW50IG49MDtuPE47bisrKXsKCQlwdnQ9bWF4KHB2dCxwb3Nbbl0pOy8v5Zue5a6255yLCgkJYW5zKz1uPT1wdnQ7Cgl9Cgljb3V0PDxhbnM7Cn0=