#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,a[2000005],b[2000005],t[2000005];
bool ans[4005][4005];
signed main(){
    freopen("sorttros.in","r",stdin);
    freopen("sorttros.out","w",stdout);
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            t[j]=0;
            b[j]=a[j];
        }
        int nxt=n-i+1;
        for(int j=1;j<=n-i;j++){
            t[b[j]]=1;
            while(t[nxt])nxt--;
            if(a[j]>a[j+1]){
                ans[n-i+1][nxt]=1;
                swap(a[j],a[j+1]);
            }
            else{
                if(a[j+1]==n-i+1)ans[n-i+1][n-i]=1;
                else ans[n-i+1][n-i+1]=1;
            }
        }
    }
    int res=0;
    bool flag=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=i;j++){
            if(i!=j&&ans[i][j])res++;
            if(i==j&&ans[i][j]&&!flag){
                flag=1;
                res++;
            }
        }
    }
    printf("%lld",res);
    return 0;
}