import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^9;

int N;
int[] S;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      S = new int[N + 1];
      foreach (i; 0 .. N + 1) {
        S[i] = readInt();
      }
      
      auto dp = new long[][N + 1];
      foreach (i; 0 .. N + 1) {
        dp[i] = new long[S[i] + 1];
        dp[i][] = INF;
      }
      dp[0][0] = 1;
      foreach (i; 0 .. N + 1) {
        foreach (a; 0 .. S[i] + 1) {
          foreach (b; 0 .. a + 1) {
            chmin(dp[i][min(a + b + 1, S[i])], dp[i][a] + dp[i][b]);
          }
        }
        if (i < N) {
          foreach (a; 0 .. S[i] + 1) {
            chmin(dp[i + 1][min(a, S[i])], dp[i][a] + 1);
          }
        }
      }
      foreach (a; 0 .. S[N] + 1) {
        if (a > 0) {
          write(" ");
        }
        write(dp[N][a]);
      }
      writeln();
    }
  } catch (EOFException e) {
  }
}