#include <iostream> #include <algorithm> using namespace std; int a[501000]; int main() { int n; cin >> n; int cnt = 0; for(int i = 1; i <= n; i++) cin >> a[i]; for(int i = 1; i <= n; i++) { bool flag = true; for(int j = i + 1; j <= n; j++) if(a[j] < a[i]) {swap(a[j], a[i]); cnt++; flag = false;} if(flag) break; } cout << cnt << endl; return 0; }