#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
#define nil -1
typedef long long ll;

using namespace std;

int inputValue(){
    int a;
    cin >> a;
    return a;
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << fixed << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

// end of template

int main() {
    cin.tie(0);
    // source code
    
    int N = inputValue(); // LV : 0 ~ 10
    vector<int> S(N + 1); // skills: 0 ~ 10
    rep(i, N + 1){
        S[i] = inputValue();
    }
    
    vector<vector<int>> dp(N + 1, vector<int>(S[N] + 1, 0)); // LV, skills
    rep(i, N + 1){
        dp[i][0] = i + 1;
    }
    
    
    repd(j, 1, S[N] + 1){ // skills
        rep(i, N + 1){ // LV
            int tmp = inf;
            if (S[i] < j) continue;
            if (i && S[i - 1] >= j){
                tmp = min(tmp, dp[i - 1][j] + 1);
            }
            for (int k = 0; j - k - 1 >= 0; k++) {
                tmp = min(tmp, dp[i][k] + dp[i][j - k - 1]);
            }
            dp[i][j] = tmp;
        }
    }
    
    rep(i, S[N] + 1){
        if (i) {
            cout << " ";
        }
        cout << dp[N][i];
    }
    cout << endl;
    
    
    return 0;
}