#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
int main(){
  ll n;cin >> n;
  vl v(n+1);rep(i,n+1)cin >> v[i];
  vvl dp(n+1,vl(15,INF));//i回進化、j回覚醒
  dp[0][0]=1;
  rep(i,n+1){
    rep(j,v[i]+1){
      if(j){
        rep(k,j){
          chmin(dp[i][j],dp[i][k]+dp[i][j-k-1]);
        }
      }
      if(i!=n)chmin(dp[i+1][j],dp[i][j]+1);
    }
  }
  /*rep(i,n+1){
    rep(j,15){
      cout << dp[i][j] <<" ";
    }
    cout << endl;
  }*/
  rep(i,v.back()+1)cout << dp[n][i] <<" ";cout << endl;

}