/* -*- coding: utf-8 -*-
 *
 * 1425.cc:  No.1425 Yet Another Cyclic Shifts Sorting - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

/* global variables */

int as[MAX_N];

/* subroutines */

bool sorted(int n) {
  for (int i = 0; i + 1 < n; i++)
    if (as[i] > as[i + 1]) return false;
  return true;
}

bool oneshift(int n) {
  int a0 = as[0], a1 = -1;
  for (int i = 0; i + 1 < n; i++) {
    if (as[i] > as[i + 1]) {
      if (a1 < 0) a1 = as[i];
      else return false;
    }
    else {
      if (a0 < as[i] && as[i] < a1) return false;
    }
  }
  return true;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  if (sorted(n)) puts("0");
  else if (oneshift(n)) puts("1");
  else puts("2");
  return 0;
}