import heapq
import sys
input = sys.stdin.readline
N = int(input())
X = list(map(int, input().split()))
A = list(map(int, input().split()))
S = [0]
for a in A:
    S.append(S[-1]^a)
INF = sum(A)
dp3 = [INF for _ in range(N)]
stack = [(0, 0)]
while stack:
    sco, i = heapq.heappop(stack)
    if i>=1 and dp3[i-1]<sco:
        continue
    for j in range(i, N):
        if sco+(S[j+1]^S[i])+(X[j]-X[i]) < dp3[j]:
            dp3[j] = sco+(S[j+1]^S[i])+(X[j]-X[i])
            heapq.heappush(stack, (dp3[j], j+1))
print(dp3[-1])