class BIT():
    def __init__(self,n):
        self.BIT=[0]*(n+1)
        self.num=n

    def query(self,idx):
        res_sum = 0
        while idx > 0:
            res_sum += self.BIT[idx]
            idx -= idx&(-idx)
        return res_sum

    #Ai += x O(logN)
    def update(self,idx,x):
        while idx <= self.num:
            self.BIT[idx] += x
            idx += idx&(-idx)
        return

N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

dA=[A[i] for i in range(N)]
for i in range(1,N):
    dA[i]=A[i]^A[i-1]

dB=[B[i] for i in range(N)]
for i in range(1,N):
    dB[i]=B[i]^B[i-1]

id=1
dic={}
for b in dB:
    if b not in dic:
        dic[b]=[]
    dic[b].append(id)
    id+=1

for b in dic:
    dic[b]=dic[b][::-1]

convertA=[-1 for i in range(N)]
for i in range(N):
    a=dA[i]
    if a not in dic:
        exit(print(-1))
    if not dic[a]:
        exit(print(-1))
    convertA[i]=dic[a].pop()

#print(convertA)

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

res=0
bit=BIT(N)
for i in range(N):
    res+=i-bit.query(convertA[i])
    bit.update(convertA[i],1)

print(res)