#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
 
int main() {
 
	int n;
	cin>>n;
 
	int a[n];
	int b[n];
	map<int,int> Map;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		b[i]=a[i];
		Map[a[i]]=i;
	}
 
	sort(b,b+n);
 
	int ans=1;
	for(int i=0;i<n-1;i++)
	{
		//cout<<"Map["<<b[i]<<"]="<<Map[b[i]]<<" Map["<<b[i+1]<<"]="<<Map[b[i+1]]<<endl;
		if(Map[b[i]] <= Map[b[i+1]])
		{
			ans++;
		}
	}
 
	cout<<ans<<endl;
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWFwPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkKCWludCBuOwoJY2luPj5uOwoJCglpbnQgYVtuXTsKCWludCBiW25dOwoJbWFwPGludCxpbnQ+IE1hcDsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgl7CgkJY2luPj5hW2ldOwoJCWJbaV09YVtpXTsKCQlNYXBbYVtpXV09aTsKCX0KCQoJc29ydChiLGIrbik7CgkKCWludCBhbnM9MTsKCWZvcihpbnQgaT0wO2k8bi0xO2krKykKCXsKCQkvL2NvdXQ8PCJNYXBbIjw8YltpXTw8Il09Ijw8TWFwW2JbaV1dPDwiIE1hcFsiPDxiW2krMV08PCJdPSI8PE1hcFtiW2krMV1dPDxlbmRsOwoJCWlmKE1hcFtiW2ldXSA8PSBNYXBbYltpKzFdXSkKCQl7CgkJCWFucysrOwoJCX0KCX0KCgljb3V0PDxhbnM8PGVuZGw7CgkKCXJldHVybiAwOwp9

NQozIDggMiAxIDU=

5
3 8 2 1 5