import sys
sys.setrecursionlimit(10 ** 6)

N = int(input())
X = list(map(int, input().split()))
A = list(map(int, input().split()))

x2i = {X[i]: i for i in range(N)}
bs = []
for i, (x, a) in enumerate(zip(X, A)):
    bs.append((x+a, i))


def dfs(p, dists, used):
    if dists[p] != 0: return dists[p]

    res = 0
    for x in [X[p] - A[p], X[p] + A[p]]:
        res = max(res, x)
        q = x2i.get(x, -1)
        if q != -1:
            if used[q]: continue
            used[q] = True
            res = max(res, dfs(q, dists, used))
            used[q] = False

    dists[p] = res
    return res


dists = [0] * N
used = [False] * N
for i in range(N):
    used[i] = True
    dfs(i, dists, used)
    used[i] = False

for i in range(N):
    print(dists[i] - X[i])