from collections import defaultdict,deque
N = int(input()) 
X = list(map(int,input().split()))
A = list(map(int,input().split()))
vec = set()
for i in range(N):
    x = X[i]
    a = A[i]
    vec.add(x)
    vec.add(x-a)
    vec.add(x+a)
memo = defaultdict(int)
vec = sorted(list(vec))
for i in range(len(vec)):
    memo[vec[i]] = i
edge = [[] for _ in range(len(vec))]
Xset = set(X)
for i in range(N):
    x = X[i]
    a = A[i]
    index = memo[x+a]
    edge[index].append(memo[x])
    index2 = memo[x-a]
    edge[index2].append(memo[x])
INF = float('inf')
dp = [-INF for _ in range(len(vec))]
q = deque()
for v in vec[::-1]:
    if dp[memo[v]] == -INF:
        q.append(memo[v])
        dp[memo[v]] = v
    while q:
        now = q.popleft()
        for nv in edge[now]:
            if dp[nv] == -INF:
                q.append(nv)
                dp[nv] = v
for x in X:
    index = memo[x]
    print(dp[index]-x)