#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<string>
#include<bitset>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=2e5+10;
const int N=2e5;
const int INF=0x3f3f3f3f;
const long long LINF=0x3f3f3f3f3f3f3f3f;
int n;
int a[MAXN],b[MAXN];
void discrete(){
    memcpy(b,a,sizeof(a));
    sort(b+1,b+1+n);
    int tot=unique(b+1,b+1+n)-b-1;
    for(int i=1;i<=n;i++)
    {
        a[i]=lower_bound(b+1,b+1+tot,a[i])-b;
    }
}
int ans1[MAXN],ans2[MAXN];
void solve(int* ans){
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=i;j++)
        {
            int cntl=0,cntr=0;
            for(int k=1;k<j;k++)
            {
                if(a[k]<a[j]){
                    cntl++;
                }
            }
            for(int k=i;k>j;k--)
            {
                if(a[k]<a[j]){
                    cntr++;
                }
            }
            ans[i]+=min(cntl,cntr);
        }
    }
}
signed main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    discrete();
    solve(ans1);
    for(int i=1;i<=n;i++)
    {
        a[i]=n+1-a[i];
    }
    solve(ans2);
    for(int i=1;i<=n;i++)
    {
        printf("%d\n",min(ans1[i],ans2[i]));
    }
    return 0;
}