import bisect

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    N = int(data[idx])
    idx += 1
    X = list(map(int, data[idx:idx+N]))
    idx += N
    A = list(map(int, data[idx:idx+N]))
    idx += N
    
    max_r = [0] * N
    
    # Process right throws from right to left
    for i in reversed(range(N)):
        target = X[i] + A[i]
        j = bisect.bisect_left(X, target)
        if j < N and X[j] == target:
            max_r[i] = A[i] + max_r[j]
        else:
            max_r[i] = A[i]
    
    max_l = [0] * N
    
    # Process left throws from left to right
    for i in range(N):
        target = X[i] - A[i]
        k = bisect.bisect_left(X, target)
        if k < N and X[k] == target:
            current = (X[k] + max_r[k]) - X[i]
            if current > 0:
                max_l[i] = current
            else:
                max_l[i] = 0
        else:
            max_l[i] = 0
    
    # Compute the answer
    ans = [max(max_r[i], max_l[i]) for i in range(N)]
    
    for a in ans:
        print(a)
        
if __name__ == '__main__':
    main()