import sys
from sys import stdin
import bisect

N = int(stdin.readline())
A = list(map(int,stdin.readline().split()))
B = [A[i] for i in range(N)]
B.sort()

while len(A) > 0 and B[-1] == A[-1]:
    del A[-1]
    del B[-1]

if len(A) == 0:
    print (0)
    sys.exit()


rev = 0
for i in range(len(A)):
    if A[i] > A[(i+1) % len(A)]:
        rev += 1

if rev <= 1:
    print (1)
else:
    print (2)