#include
using namespace std;
int n, a[10000], l = 5000, r = 5000;
void make_tree(int now)
{
int x;
cin >> x;
if(x == -1)
return;
a[now] += x;
l = min(l, now);
r = max(r, now);
make_tree(now - 1);
make_tree(now + 1);
}
int main ()
{
make_tree(5000);
for (int i = l; i <= r; ++i)
cout << a[i] << " ";
}
n=0
a=[0]*[10000]
l = [0]*5000
r = [0]*5000
def make_tree(now):
x = int(input())
if(x == -1):
return
a[now] = a[now] + x
l = min(l, now)
r = max(r, now)
make_tree(now - 1)
make_tree(now + 1)
def main():
make_tree(5000)
for (i in range(r)):
print(a[i])