#include <cstdio>
#include <cstring>
#include <vector>
#include <map>

long long n;
std::vector<long long> a, cpy;
bool special = true;



std::map<std::vector<long long>, bool> map;
int errorid;
void BubbleSort() {
    int stepid = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n - i; ++j) {
            ++stepid;
            if ((cpy[j] > cpy[j + 1] && stepid != errorid) ||
                (cpy[j] < cpy[j + 1] && stepid == errorid)) {
                cpy[j] ^= cpy[j + 1] ^= cpy[j] ^= cpy[j + 1];
            }
        }
    }
    map[cpy] = 1;
}



void Brute() {
    for (int _ = 1; _ <= n * n - n * (n + 1) / 2 ; ++_) {
        cpy = a;
        errorid++;
        BubbleSort();
    }
}

int main() {
    freopen("sorttros.in", "r", stdin);
    freopen("sorttros.out", "w", stdout);
    scanf("%lld", &n);
    a.resize(n + 1);
    
    for (long long i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
        if (a[i] != n - i + 1) special = false;
    }
    
    if (special) {
        printf("%lld\n", n * (n + 1) / 2 - n + 1);
        return 0;
    }
    
    Brute();

    
    printf("%llu\n", map.size());
    return 0;
}