#include<iostream>
#include<algorithm>
using namespace std;
int N,A[2<<17],B[2<<17];
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		B[i]=A[i];
	}
	sort(B,B+N);
	int r=N;
	while(r>0&&A[r-1]==B[r-1])r--;
	if(r==0)cout<<0<<endl;
	else
	{
		int id=r-1;
		while(A[id]!=B[r-1])id--;
		for(int i=0;i<r;i++)if(A[(id+1+i)%r]!=B[i])
		{
			cout<<2<<endl;
			return 0;
		}
		cout<<1<<endl;
	}
}