#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
//1-indexed
#include<vector>
template<typename T>
struct BIT{
	int n;
	vector<T>bit;
	BIT(int n_=0):n(n_),bit(n_+1){}
	T sum(int i)
	{
		T ans=0;
		for(;i>0;i-=i&-i)ans+=bit[i];
		return ans;
	}
	void add(int i,T a)
	{
		if(i==0)return;
		for(;i<=n;i+=i&-i)bit[i]+=a;
	}
	int lower_bound(T k)//k<=sum(ret)
	{
		if(k<=0)return 0;
		int ret=0,i=1;
		while((i<<1)<=n)i<<=1;
		for(;i;i>>=1)
			if(ret+i<=n&&bit[ret+i]<k)k-=bit[ret+=i];
		return ret+1;
	}
};
int N,A[5<<17],B[5<<17];
vector<int>a;
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		a.push_back(A[i]);
	}
	sort(a.begin(),a.end());
	a.erase(unique(a.begin(),a.end()),a.end());
	long cnt=0;
	BIT<int>P(a.size());
	for(int i=0;i<N;i++)
	{
		B[i]=lower_bound(a.begin(),a.end(),A[i])-a.begin();
		cnt+=i-P.sum(B[i]+1);
		P.add(B[i]+1,1);
	}
	cout<<cnt<<endl;
	for(int i=0;i<N-1;i++)
	{
		cnt-=B[i];
		cnt+=a.end()-upper_bound(a.begin(),a.end(),A[i]);
		cout<<cnt<<endl;
	}
}