#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a;

int solve();

int main() {
  cin >> n;
  a.resize(n);
  for (auto &p : a) cin >> p;
  cout << solve() << endl;
  return 0;
}

int solve() {
  {  // 0
    bool ch = 1;
    for (int i = 1; i < n; ++i)
      if (a[i - 1] > a[i]) ch = 0;
    if (ch) return 0;
  }
  {  // 1
    {
      vector<int> v(n);
      iota(v.begin(), v.end(), 0);
      sort(v.begin(), v.end(), [](int l, int r) {
        if (a[l] != a[r]) return a[l] < a[r];
        return l < r;
      });
      while (v.back() == v.size() - 1) v.pop_back();
      {
        int id = -1, len = v.size();
        for (int i = 0; i < len; ++i)
          if (v[i] == 0) id = i;
        bool ch = 1;
        for (int i = 0; i < len; ++i)
          if (v[(i + id) % len] != i) ch = 0;
        if (ch) return 1;
      }
    }
  }
  return 2;
}