#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
#include <set>
#include <iomanip>
#include <numeric>
#include <queue>
#include <string>
#include <map>
#include <fstream>
#include <cassert>
#include <stack>


class Bit {
	std::vector<int> vec;
public:
	Bit(const int size) :vec(size, 0) {};
	void add(int position, const int value) {
		while (position < vec.size()) {
			vec[position] += value;
			position += ~position & (position + 1);
		}
	}
	int get(int position) const {
		int result{ 0 };
		while (position >= 0) {
			result += vec[position];
			position -= ~position & (position + 1);
		}
		return result;
	}
};

int main() {
	int n; std::cin >> n;
	std::vector<int> from(n), to(n);
	for (auto& a : from) std::cin >> a;
	for (auto& b : to) std::cin >> b;
	if (from.front() != to.front() || from.back() != to.back()) {
		std::cout << "-1\n";
		return 0;
	}
	std::map<int, std::queue<int>> map;
	for (auto i = 1; i < n; ++i) {
		map[from[i] ^ from[i - 1]].push(i - 1);
	}
	std::vector<int> rank; rank.reserve(n - 1);
	for (auto i = 1; i < n; ++i) {
		if (map[to[i] ^ to[i - 1]].empty()) {
			std::cout << "-1\n";
			return 0;
		}
		rank.push_back(map[to[i] ^ to[i - 1]].front());
		map[to[i] ^ to[i - 1]].pop();
	}
	Bit bit(n - 1);
	long long int result{ 0 };
	for (auto i = 0; i < rank.size(); ++i) {
		result += i - bit.get(rank[i]);
		bit.add(rank[i], 1);
	}
	std::cout << result << '\n';
}