#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <deque>
#include <stack>
#include <atcoder/all>

using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)

int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};

typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;

const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
// const ll mod = 1e9 + 7;
//  cout << fixed << setprecision(10)
// --------------------------------------
int n;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  vector<int> a(n);
  REP(i, n) cin >> a[i];

  int m = 0, ind = 0;
  for(; ind < n; ind++) {
    if(a[ind] < m) break;
    m = a[ind];
  }

  if(ind == n) {
    cout << 0 << endl;
    return 0;
  }
  m = 0;
  FOR(i, ind, n) {
    if(a[i] < m) {
      cout << 2 << endl;
      return 0;
    }
    m = a[i];
  }

  int mi = a[0], ma = a[ind - 1];

  bool f = false;
  FOR(i, ind, n) {
    int now = a[i];
    int next = (i == n - 1 ? INF + 10 : a[i + 1]);
    if(now <= mi && ma <= next) f = true;
  }

  cout << (f ? 1 : 2) << endl;
}