from collections import deque


def bfs(G, s, N):
    Q = deque([])
    dist = [-1] * N
    par = [-1] * N
    dist[s] = 0
    for u in G[s]:
        par[u] = s
        dist[u] = 1
        Q.append(u)

    while Q:
        u = Q.popleft()
        for v in G[u]:
            if dist[v] != -1:
                continue
            dist[v] = dist[u] + 1
            par[v] = u
            Q.append(v)
            
    return dist

def popcount(n):
    cnt = 0
    while n:
        cnt += n & 1
        n //= 2
    return cnt


N = int(input())
S = list(map(int, input().split()))
S.extend(list(map(int, input().split())))
N += 2
G = [[] for i in range(N)]
for i in range(N):
    for j in range(i + 1, N):
        if popcount(S[i]^S[j]) == 1:
            G[i].append(j)
            G[j].append(i)
            
D = bfs(G, 0, N)
print(D[1] - 1) if D[1] != -1 else print(-1)