#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")

#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair

typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=1e5+10, maxm=5e3+10, lg=31, mod=1e9+7, inf=1e18;

ll n,a[maxn],b[maxn],ans;
multiset<ll> sa,sb;
map<ll,ll> par;
ll gpar(ll v){return (par[v]==v ? v:par[v]=gpar(par[v]));}
void mrg(ll v,ll u){par[gpar(v)]=gpar(u);}

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i], a[0]^=a[i], sa.insert(a[i]);
	for(int i=1;i<=n;i++) cin>>b[i], b[0]^=b[i], sb.insert(b[i]);
	sa.insert(a[0]), sb.insert(b[0]);
	if(sa!=sb) return cout<<-1,0;
	par[a[0]]=a[0];
	for(int i=1;i<=n;i++)if(a[i]!=b[i]) par[a[i]]=a[i];
	for(int i=1;i<=n;i++)if(a[i]!=b[i]) mrg(a[i],b[i]), ans++;
	for(auto e:par)if(e.F==e.S) ans++;
	cout<<ans-1;

	return 0;
}



