import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

from bisect import bisect

n = II()
aa = LI()
if aa == sorted(aa):
    print(0)
    exit()

cnt = 0
ri = r = -1
for i in range(n-1):
    if aa[i] > aa[i+1]:
        if r == -1:
            r = aa[i]
            ri = i
        else:
            print(2)
            exit()

if aa[-1]<=aa[0]:
    print(1)
    exit()

for i in range(ri, n-1):
    if aa[i] <= aa[0] and r <= aa[i+1]:
        print(1)
        exit()
print(2)