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<=p0): 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())) if A[0] != B[0]: print(-1) exit() 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() import collections C = collections.defaultdict(collections.deque) for i, y in enumerate(Y): C[y].append(i) Z = [] for x in X: Z.append(C[x].popleft()) G = fenwick_tree(N-1) ans = 0 for z in Z[::-1]: ans += G.sum0(z) G.add(z, 1) print(ans)