#include <algorithm>
#include <iostream>
using namespace std;
typedef pair<int, int> P;

int main()
{
    int n;
    cin >> n;
    int a[200005];
    int b[200005];
    for(int i = 0; i < n; i++){
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b, b + n);
    int l;
    for(l = n - 1; l >= 0; l--){
        if(a[l] == b[0] && (l == 0 || a[l - 1] != b[0])) break;
    }
    int i;
    for(i = 0; l + i < n; i++){
        if(b[i] != a[l + i]) break;
    }
    if(i == n){
        cout << 0 << endl;
        return 0;
    }
    int r = l + i;
    l = -i;
    for(; i < r; i++){
        if(b[i] != a[l + i]){
            cout << 2 << endl;
            return 0;
        }
    }
    for(; i < n; i++){
        if(b[i] != a[i]){
            cout << 2 << endl;
            return 0;
        }
    }
    cout << 1 << endl;
}