def merge(A, left, mid, right):

    cnt = 0
    n1 = mid - left
    n2 = right - mid

    L = A[left:left + n1] + [float("inf")]
    R = A[mid:mid + n2] + [float("inf")]

    i = j = 0

    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
            cnt += n1 - i

    return cnt


def merge_sort(A, left, right):

    if (left + 1 < right):
        mid = (left + right) // 2
        v1 = merge_sort(A, left, mid)
        v2 = merge_sort(A, mid, right)
        v3 = merge(A, left, mid, right)
        return v1 + v2 + v3

    else:
        return 0

n = int(input())
A = [int(input()) for i in [0]*n]

for i in [0]*n:
    print(merge_sort(A[:], 0, n))
    A = A[1:] + [A[0]]