#include <iostream>
#include <cmath>
#include <cstdio>
#include  <cstdlib>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

typedef long long ll;

void bubble(ll a[],int  n) {
	int cnt=0;
	
	for (int i = 0; i < n; i++) {
		int cnt = 0;
		for (int j = 0; j < n-1; j++) {
			if (a[j] > a[j + 1]) {
				swap(a[j], a[j + 1]);
				cnt++;
			}
			
		}
		cout << cnt << endl;
	}
	
}
int main()
{
	int n;
	ll a[500000];
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i];

	bubble(a, n);



	return 0;
}