import sys,random,bisect from collections import deque,defaultdict import heapq from itertools import permutations from math import gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) INF = 10**17 class UnionFindVerSize(): def __init__(self, N): self._parent = [n for n in range(0, N)] self._size = [1] * N self.group = N def find_root(self, x): if self._parent[x] == x: return x self._parent[x] = self.find_root(self._parent[x]) stack = [x] while self._parent[stack[-1]]!=stack[-1]: stack.append(self._parent[stack[-1]]) for v in stack: self._parent[v] = stack[-1] return self._parent[x] def unite(self, x, y): gx = self.find_root(x) gy = self.find_root(y) if gx == gy: return self.group -= 1 if self._size[gx] < self._size[gy]: self._parent[gx] = gy self._size[gy] += self._size[gx] else: self._parent[gy] = gx self._size[gx] += self._size[gy] def get_size(self, x): return self._size[self.find_root(x)] def is_same_group(self, x, y): return self.find_root(x) == self.find_root(y) N = int(input()) X = li() A = li() dic = {x:i for i,x in enumerate(X)} uf = UnionFindVerSize(N) for i in range(N): if X[i]+A[i] in dic: j = dic[X[i]+A[i]] uf.unite(i,j) if X[i]-A[i] in dic: j = dic[X[i]-A[i]] uf.unite(i,j) ans = [-1 for i in range(N)] p = [[] for i in range(N)] for i in range(N): p[uf.find_root(i)].append(i) for i in range(N): if not p[i]: continue M = max(X[v]+A[v] for v in p[i]) for v in p[i]: ans[v] = M-X[v] assert min(ans) > 0 print(*ans,sep="\n")