#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>

using namespace std;

const long long MOD = (long long)(1e9) + 7;

int main() {

  //cout << fixed << setprecision(15);

  int n;
  cin >> n;
  vector<int> p(n);
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  
  int ans  =0;
  for (int i = 0; i < n - 1; i++) {
    for (int j = i + 1; j < n; j++) {
      if (p[i] > p[j]) {
        ans++;
        swap(p[i] , p[j]);
      }
    }
  }
  cout << ans << endl;
  return 0;
}