{
	int@n;
	VI@a(n);
	VI b(n);
	rep(i,n) b[i]=i;
	sortV(a,b);
	int z=0;
	rep(i,n-1) z+=b[i]<b[i+1]-1;
	z+=b[n-1]<n-1;
	wt(z);
}