#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>



template<class T>
struct Fen {
    int n;
    vector<T> t;
    Fen (int n_) {
        init(n_);
    }
    Fen () {};
    void init(int n_) {
        n = n_;
        t.assign(n + 1, {});
    }
    void change(int u, T x) {
        for(; u <= n; u += u & -u) t[u] += x;
    }
    T sum(int u) {
        T res = 0;
        for(; u; u -= u & -u) res += t[u];
        return res;
    }
    T sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }

    int kth(T sum) {
        int i = 0;
        T tot = {};
        for (int j = 1 << __lg(n); j > 0; j /= 2) {
            if (i + j <= n && t[i + j] + tot < sum) {
                i += j;
                tot += t[i];
            }
        }
        return i + 1;
    }
};
void solve() {
    int n;
    cin >> n;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i], a[i]++;

    Fen<int> t(n + 1);

    vector<int> pre(n + 1);
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        pre[i] += t.sum(a[i] + 1, n + 1);
        t.change(a[i], 1);
        ans += pre[i];
    }

    vector<ll> res(n + 2);
    for (int i = 1; i <= n; i++) res[a[i]] += pre[i];
    for (int i = n; i >= 0; i--) res[i] += res[i + 1];
    for (auto &x : res) x = ans - x;
    for (int i = 1; i <= n; i++) cout << res[i] << '\n';
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}
/*
g++ -std=c++20 1.cpp -o 1 && 1 < in.txt > out.txt
*/