import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

# 内部で1-indexedに変えるので入力は0-indexedでよい
class BitSum:
    def __init__(self, n):
        self.n = n+1
        self.table = [0]*self.n

    def add(self, i, x):
        i += 1
        while i < self.n:
            self.table[i] += x
            i += i & -i

    # [0,i]の和
    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self.table[i]
            i -= i & -i
        return res

from collections import defaultdict

n = II()
aa = LI()
bb = LI()

if aa[0] != bb[0] or aa[-1] != bb[-1]:
    print(-1)
    exit()

dd = [a0 ^ a1 for a0, a1 in zip(aa, aa[1:])]
ff = [a0 ^ a1 for a0, a1 in zip(bb, bb[1:])]

if sorted(dd) != sorted(ff):
    print(-1)
    exit()

dtoi = defaultdict(list)
for i, d in enumerate(ff):
    dtoi[d].append(i)

for d in dtoi: dtoi[d].reverse()

ii = [dtoi[d].pop() for d in dd]
bit = BitSum(n)
ans = 0
for j, i in enumerate(ii):
    ans += j-bit.sum(i)
    bit.add(i, 1)

print(ans)