#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int bm = 100100;
int BIT[bm];
void add(int A) {
	while (A <= bm) {
		BIT[A]++;
		A += A & -A;
	}
}
int query(int A) {
	int ret = 0;
	while (A > 0) {
		ret += BIT[A];
		A -= A & -A;
	}
	return ret;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;

	int A[100000], B[100000];
	rep(i, N) cin >> A[i];
	rep(i, N) cin >> B[i];

	if (A[0] != B[0] || A[N - 1] != B[N - 1]) {
		co(-1);
		return 0;
	}

	int C[100000], D[100000];
	rep1(i, N - 1) {
		C[i] = A[i] ^ A[i - 1];
		D[i] = B[i] ^ B[i - 1];
	}

	map<int, int> MP;
	int ne[100001];
	rep1(i, N - 1) {
		ne[i] = MP[C[i]];
		MP[C[i]] = i;
	}
	ll kotae = 0;
	for (int i = N - 1; i > 0; i--) {
		int tmp = MP[D[i]];
		if (tmp == 0) {
			co(-1);
			return 0;
		}
		kotae += abs(i - (tmp - query(tmp)));
		add(tmp);
		MP[D[i]] = ne[tmp];
	}

	co(kotae);

	Would you please return 0;
}