class fenwick_tree():
    n=1
    data=[0 for i in range(n)]
    def __init__(self,N):
        self.n=N
        self.data=[0 for i in range(N)]
    def add(self,p,x):
        assert 0<=p<self.n,"0<=p<n,p={0},n={1}".format(p,self.n)
        p+=1
        while(p<=self.n):
            self.data[p-1]+=x
            p+=p& -p
    def sum(self,l,r):
        assert (0<=l and l<=r and r<=self.n),"0<=l<=r<=n,l={0},r={1},n={2}".format(l,r,self.n)
        return self.sum0(r)-self.sum0(l)
    def sum0(self,r):
        s=0
        while(r>0):
            s+=self.data[r-1]
            r-=r&-r
        return s


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

A2 = []
for i in range(N-1):
    A2.append(A[i]^A[i+1])

B2 = []
for i in range(N-1):
    B2.append(B[i]^B[i+1])

bit = fenwick_tree(N)

M = {}
for b in B2:
    M[b] = []
for i, b in enumerate(B2):
    M[b].append(i)


ans = 0
for i in range(N-2, -1, -1):
    a = A2[i]

    if not a in M or not M[a]:
        print(-1)
        exit()

    p = M[a][-1] + 1

    ans += bit.sum0(p)
    bit.add(p, 1)
    M[a].pop()
print(ans)