import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = sys.stdin.readline
input = lambda : inp().rstrip()
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda :list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 1000000007
MOD = 998244353
INF = 4611686018427387903
dx = [1, 0, -1, 0];	dy = [0, 1, 0, -1]


"""
Main Code
"""

n = getN()
x = getList()
a = getList()

d = {}
for i, k in enumerate(x):
	d[k] = i

ans = [0] * n

for _ in [0] * 10:
	ans[n - 1] = max(ans[n - 1], a[n - 1])
	for i in range(n - 2, -1, -1):
		ans[i] = max(ans[i], a[i])
		y = x[i] + a[i]
		if(y in d):
			ans[i] = max(ans[i], ans[d[y]] + a[i])
	for i in range(1, n):
		y = x[i] - a[i]
		if(y in d):
			ans[i] = max(ans[i], ans[d[y]] - a[i])

for k in ans:
	print(k)