#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>

using namespace std;

const int INF = 1e8;

int main() {
	int n;

	cin >> n;
	vector<int> s(n + 1, 0);
	for (int i = 0; i <= n; i++) {
		cin >> s[i];
	}

	int s_max = *max_element(s.begin(), s.end());

	// dp[進化][強化]
	vector< vector<int> > dp(n+1, vector<int>(s_max + 1, INF));
	for (int i = 0; i <= s[0]; i++) {
		dp[0][i] = i + 1;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= s[i]; j++) {
			dp[i][j] = min(dp[i][j], dp[i-1][j] + 1); // 進化

			for (int k = 0; k <= j - 1; k++) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[i][j - k - 1]); // 強化
			}
		}
	}

	for (int i = 0; i <= s[n]; i++) {
		printf("%s%d", (i == 0 ? "" : " "), dp[n][i]);
	}
	printf("\n");

	return 0;
}