import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

def cs(aa):
    res = [0]
    for a in aa: res.append(res[-1]+a)
    return res

n = II()
aa = LI()
bb = LI()
sa = cs(aa)
sb = cs(bb)

cc = [0]*2*n
x = y = 0
for i in range(2*n):
    if i <= n:
        x += sa[i]
        y += sb[i]
    else:
        j = i-n-1
        x += sa[n]-sa[j+1]-aa[j]*n
        y += sb[n]-sb[j+1]-bb[j]*n
    cc[i] = x+y

print(*cc)