#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

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

    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    if (is_sorted(a.begin(), a.end())) {
        cout << 0 << endl;
    } else {
        vector<int> t(n);
        int m = 0;
        for (int i = 0; i < n; i++) {
            t[i] = a[i] >= m;
            m = max(m, a[i]);
        }
        int n1 = 0;
        for (int i = n; --i >= 0;) {
            if (t[i] == 0) {
                n1 = i + 1;
                break;
            }
        }
        int i1 = -1;
        for (int i = 1; i < n1; i++) {
            if (a[i - 1] > a[i]) {
                if (i1 >= 0) {
                    cout << 2 << endl;
                    exit(0);
                }
                i1 = i;
            }
        }
        if (i1 >= 0 && a[n1 - 1] > a[0]) {
            cout << 2 << endl;
            exit(0);
        }
        cout << 1 << endl;
    }

    return 0;
}