#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    freopen("sorttors.in", "r", stdin);
    freopen("sorttors.out", "w", stdout);
    int n;
    cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    map<vector<int>, bool> vis;
    int ans = 0;
    for (int k = 1; k <= n * (n - 1) / 2; k++) {
        auto b = a;
        int cnt = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n - i; j++) {
                if (cnt == k) {
                    if (b[j] < b[j + 1]) {
                        swap(b[j], b[j + 1]);
                    }
                } else {
                    if (b[j] > b[j + 1]) {
                        swap(b[j], b[j + 1]);
                    }
                }
                cnt++;
            }
        }
        if (!vis[b]) {
            ans++;
            vis[b] = 1;
//            for (int i = 1; i <= n; i++) {
//                cout << b[i] << ' ';
//            }
//            cout << '\n';
        }
    }
    cout << ans;
    return 0;
}