#include <bits/stdc++.h>
using namespace std;
 
#define endl '\n'
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
const int N = 1e5 + 5;

int A[N], B[N], P[N];

int GetPar(int v) { return P[v] == v ? v : P[v] = GetPar(P[v]); }
void Merge(int v, int u) {
	v = GetPar(v), u = GetPar(u);
	if (u == v) return;
	P[v] = u;
}

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

	int n, x = 0, ans = 0; cin >> n;
	vector<int> a, b;
	for (int i = 0; i < n; i++) cin >> A[i], x ^= A[i];
	A[n] = x,  x = 0;
	for (int i = 0; i < n; i++) cin >> B[i], x ^= B[i];
	B[n] = x, x = 0;
	for (int i = 0; i < n; i++) if (A[i] != B[i]) a.push_back(A[i]), b.push_back(B[i]), ans++;
	a.push_back(A[n]), b.push_back(B[n]);
	sort(all(a)), sort(all(b));
	if (a != b) die(-1);
	a.resize(unique(all(a)) - a.begin()), b.resize(unique(all(b)) - b.begin());
	for (int i = 0; i < sz(a); i++) P[i] = i;
	for (int i = 0; i <= n; i++) if (A[i] != B[i]) {
		int v = lower_bound(all(a), A[i]) - a.begin();
		int u = lower_bound(all(b), B[i]) - b.begin();
		Merge(v, u);
	}
	for (int i = 0; i < sz(a); i++) ans += (GetPar(i) == i);
	cout << ans - 1 << endl;

	return 0;
}
