import sys

sys.setrecursionlimit(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 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from collections import deque

def popcnt(a): return bin(a).count("1")

n = II()+2
ss = LI()+LI()

to = [[] for _ in range(n)]
for i in range(n):
    for j in range(i):
        if popcnt(ss[i] ^ ss[j]) == 1:
            to[i].append(j)
            to[j].append(i)

q = deque()
dist = [inf]*n
q.append(0)
dist[0] = 0
while q:
    u = q.popleft()
    for v in to[u]:
        if dist[v] == inf:
            dist[v] = dist[u]+1
            q.append(v)

ans = dist[1]-1
if ans == inf-1: ans = -1
print(ans)