#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll cnt=0,n;
ll a[10010];
void bubblesort() {
	for (int i = 0; i < n-1 ; i ++ ) { 
		bool flag=true;
		for (int j = 0; j <= n-2-i ; j ++ ) if (a[j]>a[j+1])swap(a[j],a[j+1]),flag=false,cnt++;
		if (flag) break;
	}
}
int main(){
	cin >>n;
	for(int i=0;i<=n-1;i++){
		cin >>a[i];
	}
	cout << endl;
	bubblesort();
	cout << cnt;
	return 0;
}