#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	
	if (is_sorted(ALL(A))) { puts("0"); return 0; }
	
	int p = 0;
	while (A[p] <= A[p + 1]) ++p;
	
	int p2 = p + 1;
	bool ok = A[p2] <= A[0];
	while (p2 + 1 < N && A[p2] <= A[p2 + 1] && A[p2 + 1] <= A[0]) ++p2;
	if (p2 + 1 == N) { printf("%d\n", 2 - ok); return 0; }
	
	int p3 = p2 + 1;
	ok &= A[p] <= A[p3];
	while (p3 + 1 < N && A[p3] <= A[p3 + 1]) ++p3;
	ok &= p3 + 1 == N;
	printf("%d\n", 2 - ok);
}