/*
    Zadanie: Chodzenie po linie
    Autor: Tomasz Kwiatkowski
*/

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 2e5 + 7;
const int INF = 1e9 + 7;

vector<int> G[MAXN];
int n;

ll BFS(int s)
{
    vector<bool> vis(n, 0);
    vis[s] = 1;
    queue<pair<int, int>> Q;
    Q.push({s, 0});
    ll res = 0;
    while (Q.size()) {
        auto [v, d] = Q.front();
        Q.pop();
        res += d;
        for (auto u : G[v]) {
            if (!vis[u]) {
                vis[u] = 1;
                Q.push({u, d + 1});
            }
        }
    }
    return res;
}

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

    cin >> n;
    vector<int> p(n);
    for (auto& x : p)
        cin >> x;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (p[j] > p[i]) {
                G[j].pb(i);
                G[i].pb(j);
            }
        }
    }
    for (int i = 0; i < n; ++i)
        cout << BFS(i) << ' ';
    cout << '\n';
    return 0;
}