#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

typedef long long ll;
ll N;

ll merge_count(vector<ll> &a){
	int n = a.size();
	if(n<=1) return 0;
	ll cnt = 0;
	vector<ll> b(a.begin(),a.begin() + n/2);
	vector<ll> c(a.begin() + n/2, a.end());
	cnt += merge_count(b);
	cnt += merge_count(c);
	int ai = 0,bi = 0,ci = 0;
	while(ai<n){
		if(bi<b.size() && (ci == c.size() || b[bi] <= c[ci])){
			a[ai++] = b[bi++];
		}else{
			cnt += n/2 - bi;
			a[ai++] = c[ci++];
		}
	}
	return cnt;
}

int main(){
	cin >> N;
	vector<ll> v,A,B;
	map<ll,ll> m;
	for(int i=0;i<N;i++){
		ll a;
		cin >> a;
		//v.push_back(a);
		m[a]++;
		A.push_back(a);
		B.push_back(a);
	}
	ll ans[N];
	ans[N-1] = merge_count(A);
	for(auto x:m){
		v.push_back(x.first);
	}
	sort(v.begin(),v.end());
	/*ll rank[N-1];
	for(int i=0;i<N-1;i++){
		if(v[i]<v[i+1]){
			rank[v[i]] = count;
			count++;
		}
	}*/
	for(int i=0;i<N-1;i++){
		decltype(v)::iterator it = lower_bound(v.begin(),v.end(),B[N-1-i]);
		ll num = it+1-v.begin();
	//	cout << num << endl;
		ll del = num-1-(v.size()-num);
		ans[i] = ans[(i-1+N)%N] + del;
	}
	for(int i=0;i<N;i++){
		cout << ans[i] << endl;
	}
}