#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main(){
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
    P[i]--;
  }
  vector<vector<int>> S(N + 1, vector<int>(N + 1, 0));
  for (int i = 0; i < N; i++){
    for (int j = i + 1; j < N; j++){
      if (P[i] > P[j]){
        S[i][j + 1]++;
      }
    }
  }  
  for (int i = 0; i <= N; i++){
    for (int j = 0; j < N; j++){
      S[i][j + 1] += S[i][j];
    }
  }
  for (int i = N; i >= 1; i--){
    for (int j = 0; j <= N; j++){
      S[i - 1][j] += S[i][j];
    }
  }
  vector<int> dp(N + 1, -INF);
  dp[0] = 0;
  for (int i = 0; i < N; i++){
    vector<int> dp2(N + 1, -INF);
    for (int j = i; j < N; j++){
      for (int k = j + 1; k <= N; k++){
        dp2[k] = max(dp2[k], dp[j] + S[j][k]);
      }
    }
    cout << S[0][N] - dp2[N] << endl;
    swap(dp, dp2);
  }
}