#include <iostream>
#include <algorithm>
using namespace std;
int a[500000], b[500000], t[500000];
long long r;
void merge_sort(int s, int e){
    if(e-s == 1) return;
    int m = s+(e-s)/2;
    merge_sort(s, m);
    merge_sort(m, e);
    int i = s, j = m;
    for(int k=s; k<e; ++k){
        if(j==e || i<m&&b[i]<=b[j]){
            t[k] = b[i];
            ++i;
        }
        else{
            t[k] = b[j];
            ++j;
            r += m-i;
        }
    }
    for(int i=s; i<e; ++i) b[i] = t[i];
}
int main(){
    cin.tie(0), ios_base::sync_with_stdio(false); 
    int n;
    cin >> n;
    for(int i=0; i<n; ++i) cin >> a[i];
    for(int i=0; i<n; ++i) b[i] = a[i];
    merge_sort(0, n);
    for(int i=0; i<n; ++i){
        cout << r << endl;
        int l = lower_bound(b, b+n, a[i]) - b;
        int u = upper_bound(b, b+n, a[i]) - b;
        r += (n-u) - l;
    }
    return 0;
}