#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
#include<unordered_map>
using namespace std;
#define MAX 12
int dp[MAX][MAX];
vector<int> s;
int main(){
	int n;
	scanf("%d", &n);
	for (int i = 0; i <= n; i++){
		int a;
		scanf("%d", &a);
		s.push_back(a);
	}
	for (int i = 0; i <= s[0]; i++){
		dp[0][i] = i+1;
	}
	for (int i = 1; i <s.size(); i++){
		for (int j = 0; j <= s[i]; j++){
			if (i == 0 && j == 0){
				continue;
			}
			dp[i][j] = INT_MAX;
			for (int k = 0; k <= j; k++){
				int ne = j - k-1;
				if (ne >= j||ne<0||j<0){
					continue;
				}
				if (k >= j){
					continue;
				}
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[i][ne]);
			}
			if (i&&s[i - 1] >= j){
				dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
			}
		}
	}
	for (int i = 0; i <= s.back(); i++){
		if (i){
			cout << " ";
		}
		cout << dp[s.size() - 1][i];
	}
	puts("");
	return 0;
}