#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using i64 = long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


int N;
int P[3000];
int I[3001][3001];
int dp[3001] = {};
int ans[3001] = {};

int main(){
    int N; cin >> N;
    rep(i,N){ cin >> P[i]; P[i]--; }
    rep(i,N) rep(j,i) if(P[j] > P[i]) I[j][i+1]++;
    rep(r,N+1) for(int l=r-1; l>=0; l--) I[l][r] += I[l+1][r];
    rep(r,N+1) for(int l=r-1; l>=0; l--) I[l][r] += I[l][r-1];

    int dp = I[0][N];
    vector<int> A;
    rep(i,N+1) A.push_back(i);
    vector<int> ans(N);
    ans[N-1] = dp;
    for(int k=N-2; k>=0; k--){
        pair<int,int> p;
        for(int i=1; i<(int)A.size()-1; i++){
            int l = A[i-1], m = A[i], r = A[i+1];
            p = max(p, make_pair( I[l][r] - I[l][m] - I[m][r], i ));
        }
        A.erase(A.begin() + p.second);
        dp -= p.first;
        ans[k] = dp;
    }

    rep(i,N) cout << ans[i] << '\n';

    return 0;
}





struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;


/*
vector<modint> F,iF;
void initComb(int n){
    F.assign(n+1, 1);
    for(int i=1; i<=n; i++) F[i] = F[i-1] * i;
    iF.assign(n+1, F[n].inv());
    for(int i=n; i>=1; i--) iF[i-1] = iF[i] * i;
    return;
}

modint Comb(int n, int r){ return F[n] * iF[r] * iF[n-r]; }
*/