n = int(input())
BIT = [0] * (n + 1)
def zaatu(l):
    l2 = sorted(set(l))
    d = {l2[i]: i for i in range(len(l2))}
    return [d[i] for i in l]
def add(i, x):
    while i <= n:
        BIT[i] += x
        i += i & -i
def query(i):
    s = 0
    while i > 0:
        s += BIT[i]
        i -= i & -i
    return s
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if a[0] != b[0] or a[-1] != b[-1]:
    print(-1)
else:
    try:
        a2 = [a[i] ^ a[i + 1] for i in range(n - 1)]
        b2 = [b[i] ^ b[i + 1] for i in range(n - 1)]
        dic = {b2[i]: i + 1 for i in range(n - 1)}
        lis = [dic[i] for i in a2]
        ans = 0
        for i in range(n - 1):
            ans += i - query(lis[i])
            add(lis[i], 1)
        print(ans)
    except:
        print(-1)