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




import collections

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


X = [A[i]^A[i+1] for i in range(N-1)]
Y = [B[i]^B[i+1] for i in range(N-1)]

if sorted(X) != sorted(Y):
    print(-1)
    exit()

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

C = collections.defaultdict(collections.deque)
for i, y in enumerate(Y):
    C[y].append(i)

A = []
for x in X:
    A.append(C[x].popleft())

G = fenwick_tree(N)
ans = 0
for a in A:
    ans += G.sum(a+1, N)
    G.add(a, 1)

print(ans)