#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
struct BIT {
    vi b;
    int n;
    BIT(int n) : b(n + 1), n(n) {}
    void add(int i, int v) {
        for (int k = i + 1; k <= n; k += k & -k)
        	b[k] += v;
    }
    int sumb(int k) {
        int s = 0;
        for (; k > 0; k -= k & -k)
        	s += b[k];
        return s;
    }
};
void coco(vi& v, int n) {
    vector<pii> t(n);
    rep(i, 0, n) {
        t[i] = { v[i], i };
    }
    sort(all(t));
    int k = 0;
    v[t[0].se] = k;
    rep(i, 1, n) {
        if (t[i].fi != t[i - 1].fi)
        	++k;
        v[t[i].se] = k;
    }
}
int main() {
	var(int, n);
	vec(int, a, n);
	coco(a, n);
	ll s = 0;
	BIT bt(n);
	rep(i, 0, n) {
		s += i - bt.sumb(a[i] + 1);
		bt.add(a[i], 1);
	}
	rep(i, 0, n) {
		print(s);
        s -= bt.sumb(a[i]);
        s += n - bt.sumb(a[i] + 1);
	}
	return 0;
}