#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N;
int a[MAXN];
vector<int> lol;
int main(int argc, char *argv[]) {
  scanf("%d", &N);
  int p = 1;
  while (p < MAXN) {
    lol.push_back(p);
    p <<= 1;
  }
  for (int i = 0, _i = N; i < _i; ++i) {
    scanf("%d", a + i);
  }
  long long ans = 0;
  for (int i = 0, _i = N - 1; i < _i; ++i) {
    ans += a[i];
    cout << ans << '\n';
    a[i + *(--upper_bound(lol.begin(), lol.end(), N - i - 1))] += a[i];
    a[i] = 0;
  }
  return 0;
}
