#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N, ans = 0;
    cin >> N;
    vector<int> P(N), Q(N);
    rep(i, 0, N) {
        cin >> P[i];
        Q[--P[i]] = i;
    }
    //rep(i, 0, N) cout << P[i] << " " << Q[i] << endl;
    rep(i, 0, N) {
        for (int j = P[i]; j > i; j--) {
            //cout << "i=" << i << " j=" << j << endl;
            //rep(k, 0, N) cout << P[k] + 1 << " "; cout << endl;
            P[i] = j - 1;
            P[Q[j - 1]] = j;
            Q[j] = Q[j - 1];
            Q[j - 1] = i;
            ans++;
            //rep(k, 0, N) cout << P[k] + 1 << " "; cout << endl;
        }
    }
    cout << ans << endl;
}