#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    cin >> n;
    vector<int> v(n+1);
    for (auto &&i : v) scanf("%d", &i);
    auto dp = make_v(n+1, v.back()+1, INF<int>);
    dp[0][0] = 1;
    for (int i = 0; i <= n; ++i) {
        for (int j = 0; j <= v[i]; ++j) {
            if(i) dp[i][j] = dp[i-1][j]+1;
            for (int k = 0; k < j; ++k) {
                dp[i][j] = min(dp[i][j], dp[i][k]+dp[i][j-k-1]);
            }
        }
    }
    for (int i = 0; i <= v.back(); ++i) {
        if(i) printf(" ");
        printf("%d", dp.back()[i]);
    }
    puts("");
    return 0;
}