#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 200010;
const int N = 1e6 + 1;
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	if (n <= 1e3) {
		int A[n + 1];
		f1(i, n) {
			cin >> A[i];
		}
		int cnt = 0;
		while (1) {
			bool check = false;
			for (int i = 1; i < n; ++i) {
				if (A[i] > A[i + 1]) {
					swap(A[i], A[i + 1]);
					for (int j = 1; j <= n; ++j) cout << A[j] << " ";
					cout << endl;
					check = true;
					cnt++;
				}
			}
			if (!check) break;
		}
		cout << cnt;
	}
	else
	{
		pair<int, int> A[n + 1];
		f1(i, n) {
			cin >> A[i].first;
			A[i].second = i;
		}
		sort(A + 1, A + n + 1);
		set<int> se;
		int res = 0;
		se.insert(A[1].second);
		for (int i = 2; i <= n; ++i) {
			set<int>::iterator it = se.upper_bound(A[i].second);
			res += abs(int(se.size() - distance(se.begin(), it)));
			se.insert(A[i].second);
		}
		cout << res;
	}




	return 0;
}