#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<cassert>
#include<cstring>
using namespace std;
typedef pair<int,int>pint;
typedef vector<int>vint;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int mod=1000000007;

int memo[11][11];

int N;
int S[11];

int calc(int n,int s){
    if(n==0)return s+1;
    if(~memo[n][s])return memo[n][s];
    int ret=1001001001;
    if(S[n-1]>=s)chmin(ret,calc(n-1,s)+1);
    if(s){
        for(int i=0;i<s;i++)chmin(ret,calc(n,i)+calc(n,s-1-i));
    }
    return memo[n][s]=ret;
}

int main(){
    cin>>N;
    rep(i,N+1)cin>>S[i];

    memset(memo,-1,sizeof(memo));

    rep(i,S[N]+1){
        if(i)cout<<" ";
        cout<<calc(N,i);
    }cout<<endl;
}