from copy import *

N = int(input())
A = list(map(int, input().split()))
D = sorted(deepcopy(A))
for i in range(N):
    if A[-1] == D[-1]:
        A.pop()
        D.pop()
        
if A == []:
    print(0)
    exit()
    
pre = A[0]
N = len(A)
L = [A[0]]
ans = []
for i in range(1, N):
    if A[i] >= pre:
        L.append(A[i])
    else:
        ans.append(L)
        L = [A[i]]
    pre = A[i]
        
if L:
    ans.append(L)
if len(ans) > 2:
    print(2)
elif ans[1] + ans[0] == D:
    print(1)
else:
    print(2)