from collections import deque

def aa(s):
    d=1
    while s<len(fen):
        if s&d:
            fen[s]+=1;s+=d
        d<<=1
def bb(s):
    res,d=0,1
    while s:
        if s&d:
            res+=fen[s];s-=d
        d<<=1
    return res

n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if a[0]!=b[0] or a[-1]!=b[-1]:
    print(-1);exit()
for i in range(n-1):
    a[i]^=a[i+1]
    b[i]^=b[i+1]
v={}
for i in range(n-1):
    if b[i] in v:
        v[b[i]].append(i+1)
    else:
        v[b[i]]=deque([i+1])
c=[]
for i in range(n-1):
    if a[i] not in v or not v[a[i]]:
        print(-1);exit()
    c.append(v[a[i]].popleft())
fen=[0]*(n+1);ans=0
for i in range(len(c)):
    ans+=i-bb(c[i])
    aa(c[i])
print(ans)