import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int[] valuesA = new int[n];
        HashMap<Integer, ArrayDeque<Integer>> idxes = new HashMap<>();
        for (int i = 0; i < n; i++) {
            valuesA[i] = sc.nextInt();
            if (i > 0) {
                int xor = valuesA[i] ^ valuesA[i - 1];
                if (!idxes.containsKey(xor)) {
                    idxes.put(xor, new ArrayDeque<>());
                }
                idxes.get(xor).add(i);
            }
        }
        BinaryIndexedTree bit = new BinaryIndexedTree(n + 1);
        long ans = 0;
        int[] valuesB = new int[n];
        for (int i = 0; i < n; i++) {
            valuesB[i] = sc.nextInt();
            if (i > 0) {
                int xor = valuesB[i] ^ valuesB[i - 1];
                if (!idxes.containsKey(xor) || idxes.get(xor).size() == 0) {
                    System.out.println(-1);
                    return;
                }
                int v = idxes.get(xor).poll();
                ans += i - 1 - bit.getSum(v);
                bit.add(v, 1);
            }
        }
        if (valuesA[0] != valuesB[0] || valuesA[n - 1] != valuesB[n - 1]) {
            System.out.println(-1);
            return;
        }
        System.out.println(ans);
    }

}
class BinaryIndexedTree {
    int size;
    int[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new int[size];
    }
    
    public void add(int idx, int value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public int getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public int getSum(int x) {
        int mask = 1;
        int ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}