#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  scanf("%d", &N);

  vector<int> S(N + 1);
  for (int i = 0; i < N + 1; ++i) cin >> S[i];

  vector<vector<int>> d(N + 1, vector<int>(S.back() * 2 + 1, 1 << 30));
  d[0][0] = 1;
  for (int l = 0; l <= N; ++l) {
    for (int p = 0; p <= S[l]; ++p) {
      for (int q = 0; q <= S[l]; ++q) {
        int np = min(S[l], p + q + 1);
        d[l][np] = min(d[l][np], d[l][p] + d[l][q]);
      }
      if (l < N) d[l + 1][p] = min(d[l + 1][p], d[l][p] + 1);
    }
  }
  
  for (int i = 0; i <= S.back(); ++i) {
    printf("%d%c", d[N][i], " \n"[i == S.back()]);
  }

  return 0;
}