#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	vector<int> V(n);
	for (auto& v : V)
		cin >> v;

	vector<vector<int>> G(n);
	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			if (V[j] < V[i]) {
				G[i].push_back(j);
				G[j].push_back(i);
			}
		}
	}

	for (int i = 0; i < n; i++) {
		queue<int> Q; Q.push(i);
		vector<int> dist(n, INT32_MAX); dist[i] = 0;
		while (Q.size()) {
			auto u = Q.front(); Q.pop();
			for (auto& v : G[u]) {
				if (dist[v] == INT32_MAX) {
					dist[v] = dist[u] + 1;
					Q.push(v);
				}
			}
		}

		int sum = 0;
		for (auto& d : dist)
			if (d != INT32_MAX)
				sum += d;

		cout << sum << ' ';
	}
}