#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)

int A[100001], B[100000];
map<int, int> fra;
map<int, vector<int> > b;
bool vis[100001], g[100001];
set<int> vis2;

int go(int v){
	if (vis[v])return 0;
	vis[v] = true;
	int an = 1;
	if (vis2.find(A[v]) != vis2.end())return an;
	vis2.insert(A[v]);
	vector<int> &vc = b[A[v]];
	f(i, 0, vc.size())an += go(vc[i]);
	return an;
}

int main(){
	int n;
	scanf("%d", &n);
	int x = 0;
	f(i, 0, n)scanf("%d", A + i), x ^= A[i], ++fra[A[i]];
	A[n] = x;
	int ok = 0, x2 = 0;
	f(i, 0, n){
		scanf("%d", B + i);
		x2 ^= B[i];
		if (B[i] == A[i])++ok, --fra[A[i]], g[i] = true;
		else b[B[i]].push_back(i);
	}
	b[x2].push_back(n);
	++fra[x];
	for (map<int, vector<int> >::iterator it = b.begin(); it != b.end(); ++it)if (fra[it->first] != (int)it->second.size()) { printf("-1\n"); return 0; }
	int an = go(n) - 1;
	f(i, 0, n)if (!g[i] && !vis[i])an += go(i) + 1;
	printf("%d\n", an);
}