n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

ca = [0]* (n+1)
for i in range(n):
    ca[i+1] = ca[i] + a[i] + b[i]


c = [0] * (2*n + 1)
for k in range(2, 2*n + 1):
    s = c[k-1]
    e = k - (n+1)
    s += ca[min(k-1, n)] - ca[max(e,0)]
    #for j in range(max(e,0), min(k-1, n)):
        #s += a[j] + b[j]
    if e >= 1:
        s -= n * (a[e-1] + b[e-1])
    c[k] = s

print(*c[1:])