#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long n;
vector<long long> BIT(500050);
vector<pair<int, int>> vec;
int a[500050];
void add(long long i, long long x) {
	while (i <= n) {
		BIT[i] += x;
		i += i & -i;
	}
}
long long csum(long long i) {
	long long count = 0;
	while (i > 0) {
		count += BIT[i];
		i -= i & -i;
	}
	return count;
}
long long sum(long long l, long long r) {
	return csum(r) - csum(l - 1);
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		vec.emplace_back(make_pair(a[i], i));
	}
	sort(vec.begin(), vec.end());
	int now = 1;
	for (int i = 0; i < n; i++) {
		if (i != 0 && vec[i - 1].first != vec[i].first) {
			now++;
		}
		a[vec[i].second] = now;
	}
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		ans += sum(a[i] + 1, now);
		add(a[i], 1);
	}
	cout << ans << endl;
	for (int i = 0; i < n - 1; i++) {
		ans -= sum(1, a[i] - 1);
		ans += sum(a[i] + 1, now);
		cout << ans << endl;
	}
}