#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e5 + 11;
int a[N];
int solve(int *a, int n) {
	if(is_sorted(a, a + n)) return 0;
	int p = 0;
	for(int i = 0; i < n - 1; i ++)
		if(a[i] > a[i + 1]) {
			p = i + 1;
			break;
		}
	
	int q = n;
	for(int i = p; i < n; i ++)
		if(a[i] > a[0]) {
			q = i;
			break;
		}
	
	//~ cout << p << ' ' << q << '\n';
	
	rotate(a, a + p, a + q);
	if(is_sorted(a, a + n))
		return 1;
	else
		return 2;
}

int main() {
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	for(int i = 0; i < n; i ++)
		cin >> a[i];
	
	cout << solve(a, n) << '\n';
}