#include <cstdio>
#include <algorithm>
using namespace std;
int n, a[500009], p[500009], v[500009], bit[500009]; long long val;
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", &a[i]), p[i] = i, v[i] = a[i];
	sort(p, p + n, [](int i, int j) { return a[i] != a[j] ? a[i] > a[j] : i > j; });
	sort(v, v + n);
	for (int i = 0; i < n; i++) {
		for (int j = p[i]; j >= 1; j -= j & (-j)) val += bit[j];
		for (int j = p[i] + 1; j <= n; j += j & (-j)) bit[j]++;
	}
	for (int i = 0; i < n; i++) {
		printf("%lld\n", val);
		val += n - (lower_bound(v, v + n, a[i]) - v) - (upper_bound(v, v + n, a[i]) - v);
	}
	return 0;
}