import sequtils,strutils,algorithm

import sequtils,strutils
type
    binaryIndexTree[I:static[int]] = array[I + 1,int]
proc add(BIT :var binaryIndexTree,i : int, a : int)=
    var index = i
    while BIT[0] >= index:
        BIT[index] += a
        index += ((index xor (index - 1)) and index)

proc sum(BIT : binaryIndexTree, i : int):int =
    var index = i
    while index > 0:
        result += BIT[index]
        index = (index and (index - 1))


var
    BIT : binaryIndexTree[500010]
    N = stdin.readline.parseInt
    A = newSeq[int](0)
    B : seq[int]
    a,s : int
    ans : int

for n in 0..<N:
    a = stdin.readline.parseInt
    A.add(a)
B = A.sorted(system.cmp)

for n in 0..<N:
    A[n] = B.lowerBound(A[n]) + 1
BIT[0] = 500010

for n in 0..<N:
    a = n - BIT.sum(A[n])
    s += a
    BIT.add(A[n], 1)
echo s
for i in A[0..<A.high]:
    s -= BIT.sum(i - 1)
    s += N - BIT.sum(i)
    echo s