using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = new int[n];
        for (var i = 0; i < n; ++i) a[i] = NN;
        var set = new HashSet<int>() { 0 };
        for (var i = 0; i < n; ++i) set.Add(a[i]);
        var list = new List<int>(set);
        list.Sort();
        var dic = new Dictionary<int, int>();
        for (var i = 0; i < list.Count; ++i) dic[list[i]] = i;
        for (var i = 0; i < n; ++i) a[i] = dic[a[i]];
        var ft = new AtCoder.FenwickTree<int>(n + 1);
        var ans = new long[n];
        for (var i = 0; i < n; ++i)
        {
            ans[0] += i - ft.Sum(0, a[i] + 1);
            ft.Add(a[i], 1);
        }
        for (var i = 1; i < n; ++i)
        {
            ans[i] = ans[i - 1] + n - ft.Sum(0, a[i - 1] + 1) - ft.Sum(0, a[i - 1]);
        }
        WriteLine(string.Join("\n", ans));
    }
}