#include<bits/stdc++.h>
using namespace std;
constexpr int M=3e5+5;
long long ans,pre[M],suf[M];
int n,m,a[M],tr[M],lsh[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void update(int x){while (x<=m) tr[x]++,x+=x&-x;}
int query(int x){int ans=0;while (x) ans+=tr[x],x-=x&-x;return ans;}
long long getans(int n){ long long ans=1ll<<60;
    for (int i=1;i<=m;i++) tr[i]=0;
    for (int i=1;i<=n;i++) update(a[i]),pre[i]=pre[i-1]+i-query(a[i]);
    for (int i=1;i<=m;i++) tr[i]=0;
    for (int i=n;i;i--) suf[i]=suf[i+1]+n-i-query(a[i]),update(a[i]);
    for (int i=1;i<=n;i++) ans=min(ans,pre[i]+suf[i+1]);
    for (int i=1;i<=n;i++) a[i]=m+1-a[i];
    for (int i=1;i<=m;i++) tr[i]=0;
    for (int i=1;i<=n;i++) update(a[i]),pre[i]=pre[i-1]+i-query(a[i]);
    for (int i=1;i<=m;i++) tr[i]=0;
    for (int i=n;i;i--) suf[i]=suf[i+1]+n-i-query(a[i]),update(a[i]);
    for (int i=1;i<=n;i++) ans=min(ans,pre[i]+suf[i+1]);
    for (int i=1;i<=n;i++) a[i]=m+1-a[i];
    return ans;
}
int main(){ n=read();
    for (int i=1;i<=n;i++) a[i]=lsh[i]=read();
    sort(lsh+1,lsh+n+1);m=unique(lsh+1,lsh+n+1)-lsh-1;
    for (int i=1;i<=n;i++) a[i]=lower_bound(lsh+1,lsh+m+1,a[i])-lsh;
    for (int i=1;i<=n;i++) printf("%lld\n",getans(i));
    return 0;
}