#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
template <typename i>
void orange_(const char * s, i l, i r) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; l != r; l++)
        cerr << (f++ ? " " : "") << *l;
    cerr << " ]\e[0m\n";
}
template <typename ...T>
void debug_(const char * s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif


const int maxn = 200025;

struct Fenwick {
    int b[maxn];
    void add(int p, int v) {
        for (++p; p < maxn; p += p & -p)
            b[p] += v;
    }
    int query(int p) {
        int r = 0;
        for (++p; p > 0; p -= p & -p)
            r += b[p];
        return r;
    }
} lef[2], rig[2];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N;
    cin >> N;

    vector<int> a(N);
    vector<array<int,2>> val(N);
    for (int i = 0; i < N; i++)
        cin >> a[i];
    auto u = a;
    sort(u.begin(), u.end());
    for (int i = 0; i < N; i++) {
        val[i][0] = lower_bound(u.begin(), u.end(), a[i]) - u.begin();
        val[i][1] = u.end() - lower_bound(u.begin(), u.end(), a[i]);
    }

    int it[2] = {0, 0};
    int64_t current_cost[2] = {0, 0};

    for (int i = 0; i < N; i++) {
        for (int c: {0, 1}) {
            current_cost[c] += rig[c].query(val[i][c]);
            rig[c].add(val[i][c], 1);

            while (it[c] < i) {
                int64_t diff = lef[c].query(maxn - 2) - lef[c].query(val[it[c]][c]) -
                    (rig[c].query(maxn - 2) - rig[c].query(val[it[c]][c]));
                if (diff <= 0) {
                    current_cost[c] += diff;
                    lef[c].add(val[it[c]][c], 1);
                    rig[c].add(val[it[c]][c], -1);
                    ++it[c];
                } else {
                    break;
                }
            }

            debug(current_cost[0], current_cost[1]);
        }
        cout << min(current_cost[0], current_cost[1]) << '\n';
    }

    return 0;
}