#include using namespace std; using ll = long long; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector s(n + 1); for(int i = 0; i <= n; i++) cin >> s[i]; vector> dp(n + 2, vector(11, 1ll << 60)); dp[0][0] = 1; for(int i = 0; i <= n; i++){ for(int j = 0; j <= s[i]; j++){ for(int k = 0; k <= s[i] && j + k + 1 <= s[i]; k++){ dp[i][j + k + 1] = min(dp[i][j + k + 1], dp[i][j] + dp[i][k]); } dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1); } } for(int i = 0; i <= s[n]; i++){ cout << dp[n][i] << (i == s[n] ? '\n' : ' '); } }