import bisect

n = int(input())
X = list(map(int, input().split()))
A = list(map(int, input().split()))

max_reach_right = [0] * n
max_reach_left = [0] * n

# Calculate max_reach_right from right to left
for i in reversed(range(n)):
    current_pos = X[i] + A[i]
    idx = bisect.bisect_left(X, current_pos)
    if idx < n and X[idx] == current_pos:
        j = idx
        max_reach_right[i] = max(max_reach_right[j], max_reach_left[j])
    else:
        max_reach_right[i] = current_pos

# Calculate max_reach_left from left to right
for i in range(n):
    current_pos = X[i] - A[i]
    idx = bisect.bisect_left(X, current_pos)
    if idx < n and X[idx] == current_pos:
        j = idx
        max_reach_left[i] = max(max_reach_right[j], max_reach_left[j])
    else:
        max_reach_left[i] = current_pos

# Determine the maximum distance for each person
for i in range(n):
    max_distance = max(max_reach_right[i], max_reach_left[i]) - X[i]
    print(max_distance)