#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<int> A(N);
  rep(i,N) cin>>A[i];

  vector<int> B=A;
  sort(all(B));

  if(A==B){
    cout<<0<<endl;
    return 0;
  }

  vector<int> dp(N+1,0);
  dp[0]=0;
  for(int i=0;i+1<N;i++){
    dp[i+1]=dp[i];
    if(A[i]>A[i+1]) dp[i+1]++;
  }

  for(int i=N-1;i>=1;i--){
    if(dp[i]==1&&A[0]>=A[i]){
      cout<<1<<endl;
      return 0;
    }
    if(A[i]!=B[i]) break;
  }
  
  cout<<2<<endl;

  return 0;
}