#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

bool judge(vector<ll> a, vector<ll> b) {
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());

	rep(i, a.size()) {
		if (a[i] != b[i]) { return false; }
	}
	return true;
}

map<ll,ll> see;

void dfs(ll u, map<ll,vector<ll>>& g) {
	see[u] = 1;
	for (ll v : g[u]) {
		if (see[v] == 1) { continue; }
		dfs(v, g);
	}
}

int main() {
	ll N;
	cin >> N;
	vector<ll> a(N + 1);
	vector<ll> b(N + 1);

	repn(i, N) cin >> a[i];
	repn(i, N) cin >> b[i];

	a[0] = 0;
	repn(i, N) a[0] ^= a[i];
	b[0] = 0;
	repn(i, N) b[0] ^= b[i];

	
	if (!judge(a, b)) { cout << -1 << endl; return 0; }

	map<ll, vector<ll>> g;
	ll ans = N + 1;
	rep(i, N+1) {
		if (a[i] == b[i]) { ans--;  continue; }
		g[a[i]].push_back(b[i]);
		g[b[i]].push_back(a[i]);

		//cout << a[i] << b[i] << endl;
	}

	//cout << ans << endl;

	rep(i, N+1) {
		if (!g.count(a[i])||see[a[i]] == 1) { continue; }
		ans++;
		dfs(a[i], g);
	}

	if (g.count(a[0])) {
		if (a[0] != b[0]) { ans -= 2; }
		else { ans -= 1; }
	}

	cout << ans << endl;
}

Measured memory_bytes: 29920