import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353

n = ii()
x = li()
a = li()

#aの区間のXORを求める
A = [0] * (n + 1)
for i in range(n):
    A[i + 1] = A[i] ^ a[i]
def xor(l, r):
    return A[l] ^ A[r]
dp = [[inf] * (n + 1) for _ in range(n + 1)]

dp[0][0] = 0

for i in range(n - 1):
    for j in range(i + 1):
        dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + x[i + 1] - x[i])
        dp[i + 1][i + 1] = min(dp[i + 1][i + 1], dp[i][j] + xor(j, i + 1))
ans = inf
for i in range(n):
    ans = min(ans, dp[n - 1][i] + xor(i, n))
    
print(ans)