n = int(input())
*s, = map(int,input().split())
INF = 1<<30
dp = [[INF]*11 for _ in range(n+1)]
dp[0][0] = 1
for i in range(n+1):
    for j in range(s[i]+1):
        if i: dp[i][j] = dp[i-1][j] + 1
        for k in range(j):
            dp[i][j] = min(dp[i][j], dp[i][k] + dp[i][j-k-1])
print(*dp[n][:s[-1]+1])