class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group = n
        self.max_ = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return
        self.group -= 1
        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x
        self.max_[x] = max(self.max_[x], self.max_[y])

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return self.group

    def all_group_members(self):
        dic = {r:[] for r in self.roots()}
        for i in range(self.n):
            dic[self.find(i)].append(i)
        return dic

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

n = int(input())
X = list(map(int, input().split()))
A = list(map(int, input().split()))
dic = {}
for i, x in enumerate(X):
    dic[x] = i
UF = UnionFind(n)

for i in range(n):
    UF.max_[i] = A[i] + X[i]

for i in range(n):
    if X[i] - A[i] in dic:
        UF.union(i, dic[X[i] - A[i]])
    if X[i] + A[i] in dic:
        UF.union(i, dic[X[i] + A[i]])

for i in range(n):
    print(UF.max_[UF.find(i)] - X[i])