#include <iostream>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 2e5 + 5;

int segment_tree[3 * maxn];
int a[maxn];

int merge_nodes(int A, int B) {
    return A + B;
}
void build_tree(int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = a[L];
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * node);
        build_tree(middle + 1, R, 2 * node + 1);
        segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;

    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    build_tree(0, n - 1, 1);

    for(int i = 1; i <= 15; i++) {
        cout << segment_tree[i] << " ";
    }
    return 0;
}