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]))
    
    j_right = [None] * N
    j_left = [None] * N
    
    for i in range(N):
        Xi = X[i]
        Ai = A[i]
        Yr = Xi + Ai
        pos = bisect.bisect_left(X, Yr)
        if pos < N and X[pos] == Yr:
            j_right[i] = pos
        
        Yl = Xi - Ai
        pos = bisect.bisect_left(X, Yl)
        if pos < N and X[pos] == Yl:
            j_left[i] = pos
    
    M = [X[i] + A[i] for i in range(N)]
    
    # Right to left pass
    for i in range(N-1, -1, -1):
        if j_right[i] is not None:
            if M[j_right[i]] > M[i]:
                M[i] = M[j_right[i]]
    
    # Left to right pass
    for i in range(N):
        if j_left[i] is not None:
            if M[j_left[i]] > M[i]:
                M[i] = M[j_left[i]]
    
    for i in range(N):
        print(M[i] - X[i])
    
if __name__ == '__main__':
    main()