#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)

ll tentou(vector<ll> v) {
  if(v.size()<=1) {
    return 0;
  }
  ll n = v.size();
  vector<ll> h1;
  vector<ll> h2;
  for(int i=0; i<n/2; i++) {
    h1.push_back(v[i]);
  }
  for(int i=n/2; i<n; i++) {
    h2.push_back(v[i]);
  }
  ll t1 = tentou(h1);
  ll t2 = tentou(h2);
  sort(h1.begin(), h1.end());
  sort(h2.begin(), h2.end());
  ll idx=0;
  ll ans = t1+t2;
  for(auto x : h1) {
    while(idx<h2.size()&&h2[idx]<x) idx++;
    ans+=idx;
  }
  return ans;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<ll> v(n);
  map<ll,ll> m;
  rep(i, n) {
    cin >> v[i];
    if(m.find(v[i])!=m.end()) {
      m[v[i]]++;
    } else {
      m[v[i]]=1;
    }
  }
  map<ll,ll> bigger;
  map<ll,ll> smaller;
  {
    ll acc = 0;
    for(auto itr : m) {
      smaller[itr.first] = acc;
      bigger[itr.first] = n-acc-itr.second;
      acc+=itr.second;
    }
  }
  ll cnt = tentou(v);
  cout << cnt << endl;
  rep(i, n-1) {
    cnt-=smaller[v[i]];
    cnt+=bigger[v[i]];
    cout << cnt<<endl;
  }
  return 0;
}