#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/*Coding Space*/
template<class T>
struct BIT{
    vector<T> d;
    BIT(size_t n):d(n+1){}
    T sum(size_t i){T s{};for(++i;i>0;i-=i&-i)s+=d[i];return s;}
    T sum(size_t i,size_t j){return i?sum(j)-sum(i-1):sum(j);}
    void add(size_t i,T x){for(++i;i<d.size();i+=i&-i)d[i]+=x;}
};

ll inversion(vt<ll> a){ // n = a.size  O(n log n)
  BIT<ll> bit(500000);
  ll ret = 0;
  rep(i,a.size()){
    ret += i - bit.sum(a[i]);
    bit.add(a[i],1);
  }
  return ret;
}
int main(){
  int n;  cin >> n;
  vt<ll> in(n); rep(i,n)cin >> in[i];
  ll ans = inversion(in);
  vt<ll> t(n);
  rep(i,n) t[i] = in[i];
  sort(ALL(t));
  rep(i,n){
    if(i == 0)cout << ans << endl;
    else{
      int lower = (int)(lower_bound(ALL(t),in[i-1]) - t.begin());
      int upper = (int)(t.end() - upper_bound(ALL(t), in[i-1]));
      //cerr << i << " " << lower << " " << upper << endl;
      ans = ans - lower + upper;
      cout << ans << endl;
    }
  }
}