#include <bits/stdc++.h>
using namespace std;
inline long long get_num(char ch) {
  if (ch == '-')
    return 0;
  else if (ch >= 'a' && ch <= 'z') {
    return 1 + (ch - 'a');
  } else if (ch >= 'A' && ch <= 'Z') {
    return 27 + (ch - 'A');
  } else if (ch >= '0' && ch <= '9') {
    return 53 + (ch - '0');
  }
}
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
inline int GA(long long n, vector<long long>& vec) {
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    vec.push_back(x);
  }
  return 0;
}
inline int GAEG(long long m, vector<long long> vec[]) {
  for (long long i = 0; i < m; ++i) {
    long long x, y;
    cin >> x >> y;
    x--, y--;
    vec[x].push_back(y);
    vec[y].push_back(x);
  }
  return 0;
}
long long pw(long long x, long long y) {
  if (y == 0) return 1;
  long long o = y / 2;
  long long f = pw(x, o);
  if (y % 2) {
    return f * f * x;
  } else
    return f * f;
}
const long long MD = 1e9 + 7;
using namespace std;
int main() {
  long long o = 0;
  long long n;
  cin >> n;
  vector<long long> v;
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    v.push_back(x);
  }
  vector<long long> ans;
  for (long long i = 0; i < n - 1; ++i) {
    if (v[i]) {
      long long p;
      bool bl = false;
      for (int j = 20; j >= 0; j--) {
        p = i + pw(2, j);
        if (p < n) break;
      }
      if (p < n) {
        v[p] += v[i];
        o += v[i];
      }
    }
    ans.push_back(o);
  }
  for (auto i : ans) cout << i << endl;
  return 0;
}
