import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n=II()
aa=LI()
bb=LI()

b2i={b:i for i,b in enumerate(bb)}
aa=[b2i[a] for a in aa]
# print(aa)

ans=0
for k in range(17):
    cnt=[0]*n
    ispre=set()
    for a in aa:
        a>>=k
        if a&1 and cnt[a^1]<1<<k:ispre.add(a^1)
        cnt[a]+=1
    if not ispre:continue
    ans+=1
    pre,pos=[],[]
    for a in aa:
        if a>>k in ispre:
            pre.append(a)
        else:
            pos.append(a)
    aa=pre+pos
    # print(k,aa)
print(ans)