#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
using namespace std;

const int MAXN = 100055;

struct DJF {
	DJF() { init(); }
	int ud[MAXN*2];

	void init() { iota(ud, ud+MAXN*2, 0); }
	int uf(int i) { return i == ud[i] ? i : (ud[i] = uf(ud[i])); }
	void uf(int a, int b) { ud[uf(b)] = uf(a); }
} djf;

vector<int> XV, UV;

int A[MAXN], B[MAXN];

int N, Ans;

int getI(int x) { return int(lower_bound(allv(XV), x) - XV.begin()); }

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

	cin >> N;
	for(int i = 1; i <= N; i++) {
		cin >> A[i];
		A[0] ^= A[i];
	}
	for(int i = 1; i <= N; i++) {
		cin >> B[i];
		B[0] ^= B[i];
	}
	{
		vector<int> AV, BV;
		for(int i = 0; i <= N; i++) AV.eb(A[i]);
		for(int i = 0; i <= N; i++) BV.eb(B[i]);
		sorv(AV); sorv(BV);
		if(AV != BV) {
			puts("-1");
			exit(0);
		}
	}
	XV.eb(A[0]); XV.eb(B[0]);
	for(int i = 1; i <= N; i++) if(A[i] != B[i]) {
		XV.eb(A[i]);
		XV.eb(B[i]);
		Ans++;
	}
	sorv(XV); univ(XV);
	for(int i = 1; i <= N; i++) if(A[i] != B[i])
		djf.uf(getI(A[i]), getI(B[i]));
	for(int i = sz(XV); i--;) UV.eb(djf.uf(i));
	sorv(UV); univ(UV);

	cout << Ans + sz(UV) - 1 << endl;
	return 0;
}