"""

"""

import sys
from sys import stdin
from collections import deque

def uf_find(n,p):

    ufl = []

    while p[n] != n:
        ufl.append(n)
        n = p[n]

    for i in ufl:
        p[i] = n

    return n


def uf_union(a,b,p,rank):

    ap = uf_find(a,p)
    bp = uf_find(b,p)

    if ap == bp:
        return True
    else:

        if rank[ap] > rank[bp]:
            p[bp] = ap
        elif rank[ap] < rank[bp]:
            p[ap] = bp
        else:
            p[bp] = ap
            rank[ap] += 1

        return False

N = int(stdin.readline())

X = list(map(int,stdin.readline().split()))
A = list(map(int,stdin.readline().split()))

dic = {}

for i in range(N):
    dic[X[i]] = i

lis = [ [] for i in range(N)]

for i in range(N):

    lx = X[i] - A[i]
    if lx in dic:
        nex = dic[lx]
        lis[nex].append(i)

    lx = X[i] + A[i]
    if lx in dic:
        nex = dic[lx]
        lis[nex].append(i)

q = deque()
    
B = [None for i in range(N)]

wow = [ (X[i]+A[i],i) for i in range(N) ]
wow.sort()
wow.reverse()

for dist,ind in wow:

    if B[ind] == None:
        q.append(ind)
        B[ind] = dist

        while q:
            v = q.popleft()
            for nex in lis[v]:
                if B[nex] == None:
                    B[nex] = B[v]
                    q.append(nex)

#print (B)
ANS  = []
for i in range(N):
    ANS.append(str(B[i]-X[i]))

print ("\n".join(ANS))