n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

# Adjust to 1-based indexing by prepending a 0
A = [0] + A
B = [0] + B

# Precompute prefix sums for A and B arrays
prefix_A = [0] * (n + 1)
prefix_jA = [0] * (n + 1)
prefix_B = [0] * (n + 1)
prefix_iB = [0] * (n + 1)

for i in range(1, n + 1):
    prefix_A[i] = prefix_A[i - 1] + A[i]
    prefix_jA[i] = prefix_jA[i - 1] + i * A[i]
    prefix_B[i] = prefix_B[i - 1] + B[i]
    prefix_iB[i] = prefix_iB[i - 1] + i * B[i]

result = []
for k in range(1, 2 * n + 1):
    a = max(1, k - n)
    b = min(n, k - 1)
    if a > b:
        sum_A = 0
        sum_jA_val = 0
        sum_B = 0
        sum_iB_val = 0
    else:
        sum_A = prefix_A[b] - prefix_A[a - 1]
        sum_jA_val = prefix_jA[b] - prefix_jA[a - 1]
        sum_B = prefix_B[b] - prefix_B[a - 1]
        sum_iB_val = prefix_iB[b] - prefix_iB[a - 1]
    c = k * (sum_A + sum_B) - (sum_jA_val + sum_iB_val)
    result.append(str(c))

print(' '.join(result))