#include "bits/stdc++.h"
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>;
using vvll=vector<vll>;
using pii=pair<int,int>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sor(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define pb push_back
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>void printv(vector<T> v){ll n=v.size(); rep(i,n){cout<<v[i]; if(i==n-1)cout<<endl; else cout<<' ';}}
template<class T>void printvv(vector<vector<T>> v){ll n=v.size(); rep(i,n) printv(v[i]); cout<<endl;}
//const int INF = 1123456789;
//const int mod = 1e9+7;
//const int mod=998244353;

int main(){
    int n; cin>>n;
    vi p(n); rep(i,n) {cin>>p[i]; --p[i];}
    vi q(n); rep(i,n) q[i]=i;
    int cnt=0;
    while(p!=q){
        rep(i,n-1) if(p[i]>p[i+1]){++cnt; swap(p[i],p[i+1]);}
    }
    /*rep(i,n-1){
        if(p[i]==i) continue;
        ++cnt;
        int j=i+1;
        for(;j<n;++j) if(p[j]==i) break;
        swap(p[i],p[j]);
    }*/
    cout<<cnt<<endl;
}