W=[0]*10**6
def bit(a,n)
	r=0_i64
	i=n-1
	while i>=0
		idx=a[i];while idx>0;r+=W[idx];idx&=idx-1 end
		idx=a[i];while idx<=n;W[idx]+=1;idx+=idx&-idx end
		i-=1
	end
	r
end
a=ARGF.gets_to_end.split.map(&.to_i)
n=a.shift
z=(1..n).to_a.sort{|i,j|a[i-1]!=a[j-1] ? a[i-1]<=>a[j-1] : i<=>j}
x=bit(z,z.size)
b=a.sort
n.times{|i|
	puts x
	x-=((0...n).bsearch{|j|a[i]<=b[j]}||n)-n+((0...n).bsearch{|j|a[i]<b[j]}||n)
}