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