import sys
from collections import defaultdict
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()
A,B = LI(),LI()

if A[0] != B[0]:
    print(-1)
    exit()

AA = [0]+[A[i]^A[i+1] for i in range(N-1)]
BB = [0]+[B[i]^B[i+1] for i in range(N-1)]
dic_AA = defaultdict(list)
dic_BB = defaultdict(list)
for i in range(1,N):
    aa,bb = AA[i],BB[i]
    dic_AA[aa].append(i)
    dic_BB[bb].append(i)

P = [0]*(N-1)
for k in dic_AA.keys():
    if len(dic_AA[k]) != len(dic_BB[k]):
        print(-1)
        exit()
    for i,j in zip(dic_AA[k],dic_BB[k]):
        P[i-1] = j


def inversion(N,A):  # 1~Nの順列Aの転倒数を求める
    tree = [0]*(N+1)
    res = N*(N-1)//2
    for i in range(N):
        a = A[i]

        x = A[i]-1
        while x:
            res -= tree[x]
            x -= x & (-x)
        y = a
        while y <= N:
            tree[y] += 1
            y += y & (-y)

    return res


ans = inversion(N-1,P)
print(ans)