using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
    void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }

    void solve()
    {
        int N = cin.nextint;
        var A = new int[N];
        var D = new int[N];
        var ID = new int[N];
        for (int i = 0; i < N; i++)
        {
            int k = cin.nextint;
            A[i] = k;
            D[i] = k;
            ID[i] = i;
        }
        Array.Sort(D, ID);
        var J = new int[N]; //A_i より大きいものが何個あるか
        var P = new int[N]; //A_iより小さいものが何個あるか

        for (int i = 0; i < N; i++)
        {
            J[ID[i]] = N - upper_bound(D, D[i]);
            P[ID[i]] = lower_bound(D, D[i]);
        }
        //WriteLine(string.Join(" ", J));

        var s = merge_count(A);
        WriteLine(s);

        for (int i = 0; i < N - 1; i++)
        {
            s = s + J[i] - P[i];
            WriteLine(s);
        }
    }

    int lower_bound(int[] arr, int val)
    {
        int low = 0, high = arr.Count();
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid] < val) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    int upper_bound(int[] arr, int val)
    {
        int low = 0, high = arr.Count();
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid] <= val) low = mid + 1;
            else high = mid;
        }
        return low;
    }

    long merge_count(int[] A)
    {
        int n = A.Length;
        if (n <= 1) return 0;

        long cnt = 0;
        var B = A.Take(n / 2).ToArray();
        var C = A.Skip(n / 2).ToArray();

        cnt += merge_count(B);
        cnt += merge_count(C);

        int ai = 0, bi = 0, ci = 0;
        while (ai < n)
        {
            if (bi < B.Length && (ci == C.Length || B[bi] <= C[ci]))
            {
                A[ai++] = B[bi++];
            }
            else
            {
                cnt += n / 2 - bi;
                A[ai++] = C[ci++];
            }
        }
        return cnt;
    }

}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}