#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

template<typename T>
struct BinaryIndexedTree {
	using value_type = T;
	using const_reference = const value_type &;
	using F = std::function<value_type(const_reference, const_reference)>;
	using size_type = std::size_t;
	
	BinaryIndexedTree(size_type n, const F & f, const_reference id_elem) : n(n), f(f), id_elem(id_elem) {
		node.resize(n + 1, id_elem);
	}
	
	size_type size() const noexcept {
		return n;
	}
	
	void add(size_type i, const_reference x) {
		assert(i < size());
		++i;
		for (; i <= size(); i += i & -i) node[i] = f(node[i], x);
	}
	
	// [0, i)
	value_type sum(size_type i) const {
		assert(i <= size());
		value_type res = id_elem;
		for (; i > 0; i -= i & -i) res = f(res, node[i]);
		return res;
	}
	
	// sum[0, r] <= x を満たす最小の r を返す (存在しなければ size())
	size_type lower_bound(const_reference x) const {
		size_type res = 0;
		size_type s = id_elem, w = 1;
		while (w < size()) w <<= 1;
		for (; w > 0; w >>= 1) {
			if (res + w <= size()) {
				value_type cur = f(s, node[res + w]);
				if (cur < x) {
					res += w;
					s = cur;
				}
			}
		}
		return res;
	}
	
private:
	size_type n;
	F f;
	value_type id_elem;
	std::vector<value_type> node;
};

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	
	BinaryIndexedTree<int> bit(N, [](int a, int b) { return a + b; }, 0);
	ll ans = 0;
	REP(i, N) {
		ans += bit.sum(N) - bit.sum(A[i]);
		bit.add(A[i], 1);
	}
	
	REP(i, N) {
		printf("%lld\n", ans);
		if (i + 1 == N) break;
		ans -= bit.sum(A[i]);
		ans += bit.sum(N) - bit.sum(A[i] + 1);
	}
}
#include <bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<#x<<"="<<x<<endl;
#define endl '\n'
#define M 1000000007
#define int long long
#define INF 1e18
#define N 1000005

using namespace std;

vector<ll> bit, bit2;
ll n;
void update(ll x, ll v, vector<ll> &bitt)
{
	while (x <= n)
	{
		bitt[x] += v;
		x += (x & (-x));
	}
}

ll query(ll x, vector<ll> &bitt)
{
	ll sum = 0;
	while (x > 0)
	{
		sum += bitt[x];
		x -= (x & (-x));
	}
	return sum;
}

void solve()
{
	cin >> n;
	bit = vector<ll>(n + 2, 0);
	ll a[n];
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i];
		a[i]++;
	}
	ll ans = 0;
	for (int i = n - 1; i >= 0; --i)
	{
		update(a[i], 1, bit);
		ans += query(a[i] - 1, bit);
	}
	for (int i = 0; i < n; ++i)
	{
		cout << ans << endl;
		ans -= a[i] - 1;
		ans += n - a[i];
	}
}

int32_t main()
{
	IOS
	ll T = 1;
	// cin >> T;
	for (ll i = 1; i <= T; ++i)
	{
		// cout<<"Case #"<<i<<": ";
		solve();
	}
	return 0;
}