#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int32_t main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<ll> arr(N + 1);
for (int i = 1;i <= N;i ++) cin >> arr[i];
vector<vector<array<ll, 2>>> dp(N + 2, vector<array<ll, 2>>(N + 2, {0, 0}));
for (int i = 1;i <= N;i ++) {
for (int j = 1;j <= (i + 1) / 2;j ++) {
dp[i][j][0] = max(dp[i - 1][j][1], dp[i - 1][j][0]);
dp[i][j][1] = arr[i] + dp[i - 1][j - 1][0];
}
}
for (int i = 1;i <= (N + 1) / 2;i ++) {
cout << max(dp[N][i][0], dp[N][i][1]) << "\n";
}
}
