#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;
using ull = unsigned long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353;
constexpr int MAX = 1100000;

template<typename T>
struct BIT {
	int n;
	vector<T> bit;
	BIT() :n(0) {}
	BIT(int _n) :n(_n) { bit = vector<T>(n + 1); }
	void add1(int idx, T val) {
		for (int i = idx; i <= n; i += i & -i) bit[i] += val;
	}
	T sum1(int idx) {
		T res = 0;
		for (int i = idx; i > 0; i -= i & -i) res += bit[i];
		return res;
	}
	//0-indexed
	void add(int idx, T val) { add1(idx + 1, val); }
	//0-indexed [left, right)
	T sum(int left, int right) { return sum1(right) - sum1(left); }

	int lower_bound(T x) {
		int res = 0;
		int k = 1;
		while (2 * k <= n) k <<= 1;
		for (; k > 0; k >>= 1) {
			if (res + k <= n and bit[res + k] < x) {
				x -= bit[res + k];
				res += k;
			}
		}
		return res;
	}
};

void fail() {
	cout << -1 << '\n';
	exit(0);
}

bool check(vector<int> a, vector<int> b) {
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	return a == b;
}
int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int n; cin >> n;
	vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i];
	vector<int> b(n); for (int i = 0; i < n; i++) cin >> b[i];
	if (a[0] != b[0] or a.back() != b.back()) fail();
	vector<int> c(n - 1); for (int i = 0; i + 1 < n; i++) c[i] = a[i] ^ a[i + 1];
	vector<int> d(n - 1); for (int i = 0; i + 1 < n; i++) d[i] = b[i] ^ b[i + 1];
	if (!check(c, d)) fail();
	map<int, vector<int>> mp;
	for (int i = 0; i < d.size(); i++) {
		mp[d[i]].emplace_back(i);
	}
	for (auto& p : mp) {
		reverse(p.second.begin(), p.second.end());
	}
	for (int i = 0; i < c.size(); i++) {
		int t = mp[c[i]].back();
		mp[c[i]].pop_back();
		c[i] = t;
	}
	BIT<ll> bit(n);
	ll res = 0;
	for (int i = 0; i < c.size(); i++) {
		res += bit.sum(c[i], n);
		bit.add(c[i], 1);
	}
	cout << res << endl;
}