import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N=int(readline())
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
AB=[0]+[a+b for a,b in zip(A,B)]
ABI=[0]+[(a+b)*i for i,(a,b) in enumerate(zip(A,B))]
for i in range(1,N+1):
    AB[i]+=AB[i-1]
    ABI[i]+=ABI[i-1]
ans_lst=[(AB[min(N,i)]-AB[max(i-N,0)])*i-(ABI[min(N,i)]-ABI[max(i-N,0)]) for i in range(2*N)]
print(*ans_lst)