#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
const ll inf=1001001001001001001;

int main(){
    ll n;cin>>n;
    vvi dp(n,vi(n,inf)),table(n,vi(n,-1)),cost(n,vi(n));
    vi v(n);rep(i,n)cin>>v[i];
    rep(i,n)v[i]--;
    rep(l,n){
        vi cnt(n);
        rep(i,l)cnt[v[i]]++;
        for(int i=n-1;i;i--)cnt[i-1]+=cnt[i];
        ll sum=0;
        REP(r,l,n){
            sum+=cnt[v[r]];
            cost[l][r]=sum;
        }
    }
    rep(i,n){
        dp[0][i]=cost[0][i];
        for(ll j=min(n-1,i);j;j--){
            ll l=max(table[j][i-1],j),r=i;
            if(j!=min(n-1,i))r=table[j+1][i];
            REP(t,l,r+1)if(chmin(dp[j][i],cost[t][i]+dp[j-1][t-1]))table[j][i]=t;
        }
    }
    rep(i,n)cout<<dp[i][n-1]<<endl;
}