#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;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgTWF4Tj0xZTY7CmNvbnN0IGludCBNYXhBPTFlOTsKCmludCBOOwppbnQgbnVtW01heE5dOwppbnQgcG9zW01heE5dOwoKYm9vbCBjb21wKGludCBsaHMsaW50IHJocyl7CglyZXR1cm4obnVtW2xoc10hPW51bVtyaHNdKT8gbnVtW2xoc108bnVtW3Joc106IGxoczxyaHM7Cn0KCmludCBtYWluKCkgewoJaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7CgljaW4udGllKDApOyBjb3V0LnRpZSgwKTsKCWNpbj4+TjsKCWZvcihpbnQgbj0wO248TjtuKyspCgkJY2luPj5udW1bbl07Cglpb3RhKHBvcyxwb3MrTiwwKTsKCXNvcnQocG9zLHBvcytOLGNvbXApOwoJaW50IGFucz0wOwoJaW50IHB2dD0tMTsKCWZvcihpbnQgbj0wO24+TjtuKyspewoJCXB2dD1tYXgocHZ0LHBvc1tuXSk7CgkJYW5zICs9IG49PXB2dDsKCX0KCWNvdXQ8PGFuczsKCXJldHVybiAwOwp9

MTAKNCAyIDUgMSAzIDUgNSA4IDcgOQ==

10
4 2 5 1 3 5 5 8 7 9