#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int N, S[10], dp[11][11];

int f(int n, int k){
    int &r = dp[n][k];
    if(r != -1)return r;
    if(n == 0 && k == 0)return r = 1;

    r = INT_MAX;
    if(n > 0 && S[n-1]>=k)
        smin(r, f(n - 1, k) + 1);

    if(k > 0){
        rep(a, k){
            int b = k - a - 1;
            smin(r, f(n, a) + f(n, b));
        }
    }
    return r;
}

int main(){
    while(cin >> N){
        N++;
        rep(i, N)cin >> S[i];
        int num = S[N - 1] + 1;
        MEM(dp, -1);
        rep(i, num){
            printf("%d%c", f(N - 1, i), i == num - 1 ? '\n' : ' ');
        }
    }
}