#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef tuple<int, int, int> TIII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;
	VI S(N + 1);
	REP(i, N + 1) cin >> S[i];

	const int MAX = 10000000;
	VVI dp(N + 1, VI(11, MAX));
	REP(i, N + 1) dp[i][0] = i + 1;

	REP(i, N + 1){
		REP(j, 11){
			if(j > S[i]) break;
			if(i != 0 && j != 0) dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
			REP(k, j + 1){
				if(j + k + 1 > S[i]) break;
				dp[i][j + k + 1] = min(dp[i][j + k + 1], dp[i][j] + dp[i][k]);
			}
		}
	}
/*
	REP(i, N + 1){
		REP(j, 11) cout << dp[i][j] << " ";
		cout << endl;
	}
*/

	REP(i, S[N] + 1){
		cout << dp[N][i];
		if(i != S[N] + 1) cout << " ";
	}
	cout << endl;


	return 0;
}