#include <bits/stdc++.h>
using namespace std;
const long long maxN = 6e5+10;
long long a[maxN],temp[maxN];
long long N;

long long tree1[maxN],tree2[maxN];
long long  lowbit(int x){return x&(-x);}
void add(long long tree[],long long x,long long k){for(;x<=N*2;x+=lowbit(x))tree[x]+=k;}
long long pre(long long tree[],long long x)
{
    long long ans=0;
    for(;x;x-=lowbit(x))ans+=tree[x];
    return ans;
}

int main()
{
    cin>>N;
    for(int i=0;i<=N-1;i++)cin>>a[i];
    for(int i=N;i<=N+N-1;i++)a[i]=a[i-N];
    for(int i=0;i<=N+N-1;i++)temp[i]=a[i];
    sort(temp,temp+N+N-1);
    int siz=unique(temp,temp+N+N-1)-temp;
    for(int i=0;i<=N+N-1;i++)a[i]=lower_bound(temp,temp+siz,a[i])-temp+1;
    long long ans=0;
    for(int i=N-1;i>=0;i--)
    {
        ans+=pre(tree1,a[i]-1);
        add(tree1,a[i],1);
    }
    for(int i=0;i<=N-1;i++)add(tree2,a[i],1);
    int L=0,R=N-1;
    for(int i=0;i<=N-1;i++)
    {
        cout<<ans<<endl;
        add(tree2,a[L],-1);
        ans-=pre(tree2,a[L]);
        L++;
        R++;
        add(tree2,a[R],1);
        ans+=N-pre(tree2,a[R]);
    }
}
//I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii pair<double,double>
#define LOWBIT(x) x & (-x)

#define rep(i,a,b) for (int i=a;i<=b;i++)
#define REP(i,a,b) for (int i=a;i>=b;i--)

const int INF=2e9;
const LL LINF=2e16;
const int magic=348;
const int MOD=1e9+7;
const double eps=1e-10;
const double pi=acos(-1);

struct fastio
{
    static const int S=1e7;
    char rbuf[S+48],wbuf[S+48];int rpos,wpos,len;
    fastio() {rpos=len=wpos=0;}
    inline char Getchar()
    {
        if (rpos==len) rpos=0,len=fread(rbuf,1,S,stdin);
        if (!len) return EOF;
        return rbuf[rpos++];
    }
    template <class T> inline void Get(T &x)
    {
        char ch;bool f;T res;
        while (!isdigit(ch=Getchar()) && ch!='-') {}
        if (ch=='-') f=false,res=0; else f=true,res=ch-'0';
        while (isdigit(ch=Getchar())) res=res*10+ch-'0';
        x=(f?res:-res);
    }
    inline void getstring(char *s)
    {
        char ch;
        while ((ch=Getchar())<=32) {}
        for (;ch>32;ch=Getchar()) *s++=ch;
        *s='\0';
    }
    inline void flush() {fwrite(wbuf,1,wpos,stdout);fflush(stdout);wpos=0;}
    inline void Writechar(char ch)
    {
        if (wpos==S) flush();
        wbuf[wpos++]=ch;
    }
    template <class T> inline void Print(T x,char ch)
    {
        char s[20];int pt=0;
        if (x==0) s[++pt]='0';
        else
        {
            if (x<0) Writechar('-'),x=-x;
            while (x) s[++pt]='0'+x%10,x/=10;
        }
        while (pt) Writechar(s[pt--]);
        Writechar(ch);
    }
    inline void printstring(char *s)
    {
        int pt=1;
        while (s[pt]!='\0') Writechar(s[pt++]);
    }
}io;

template<typename T> inline void check_max(T &x,T cmp) {x=max(x,cmp);}
template<typename T> inline void check_min(T &x,T cmp) {x=min(x,cmp);}
template<typename T> inline T myabs(T x) {return x>=0?x:-x;}
template<typename T> inline T mygcd(T x,T y) {return y==0?x:mygcd(y,x%y);}
inline int add(int x) {if (x>=MOD) x-=MOD;return x;}
inline int add(int x,int MO) {if (x>=MO) x-=MO;return x;}
inline int sub(int x) {if (x<0) x+=MOD;return x;}
inline int sub(int x,int MO) {if (x<0) x+=MO;return x;}
inline void Add(int &x,int y) {x=add(x+y);}
inline void Add(int &x,int y,int MO) {x=add(x+y,MO);}
inline void Sub(int &x,int y) {x=sub(x-y);}
inline void Sub(int &x,int y,int MO) {x=sub(x-y,MO);}
template<typename T> inline int quick_pow(int x,T y) {int res=1;while (y) {if (y&1) res=1ll*res*x%MOD;x=1ll*x*x%MOD;y>>=1;}return res;}
template<typename T> inline int quick_pow(int x,T y,int MO) {int res=1;while (y) {if (y&1) res=1ll*res*x%MO;x=1ll*x*x%MO;y>>=1;}return res;}

const int MAXN=3e5;

int n;
int a[MAXN+48];

namespace BIT
{
    int c[MAXN+48];
    void clear() {memset(c,0,sizeof(c));}
    void modify(int x) {while (x<=n) c[x]++,x+=LOWBIT(x);}
    int query(int x) {int res=0;while (x) res+=c[x],x^=LOWBIT(x);return res;}
}

int main ()
{
#ifndef ONLINE_JUDGE
    double TIME=clock();
    freopen ("a.in","r",stdin);
    freopen ("a.out","w",stdout);
    cerr<<"Running..."<<endl;
#endif
    scanf("%d",&n);rep(i,1,n) scanf("%d",a+i),a[i]++;LL ans=0;
    BIT::clear();rep(i,1,n) ans+=(i-1)-BIT::query(a[i]),BIT::modify(a[i]);
    printf("%lld\n",ans);
    rep(i,1,n-1)
    {
        ans-=(a[i]-1);
        ans+=(n-a[i]);
        printf("%lld\n",ans);
    }
#ifndef ONLINE_JUDGE
    cerr<<"Exec Time: "<<(clock()-TIME)/CLOCKS_PER_SEC<<endl;
#endif
    return 0;
}