//#pragma comment(linker, "/STACK:1024000000,1024000000")
//#pragma GCC optimize (2)
//#pragma G++ optimize (2)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 100010
int n,a[N],b[N],as[N],bs[N],al,bl,f[N],ans;
int find(int x){ return x==f[x] ? x : f[x]=find(f[x]); }
int main(){
	//freopen("duliu_3.in","r",stdin);
	//freopen("duliu.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;++i){ scanf("%d",&a[i]); as[i]=a[i]; a[n+1]^=a[i]; }
	for(int i=1;i<=n;++i){ scanf("%d",&b[i]); bs[i]=b[i]; b[n+1]^=b[i]; }
	as[n+1]=a[n+1]; bs[n+1]=b[n+1];
	sort(as+1,as+n+2); 
	sort(bs+1,bs+n+2); 
	for(int i=1;i<=n+1;++i)if(as[i]^bs[i]){puts("-1");return 0;}
	al=unique(as+1,as+n+2)-(as+1);
	bl=unique(bs+1,bs+n+2)-(bs+1);
	if(al^bl){ puts("-1"); return 0; }
	for(int i=1;i<=n+1;++i){
		a[i]=lower_bound(as+1,as+1+al,a[i])-as;
		b[i]=lower_bound(bs+1,bs+1+bl,b[i])-bs;
	}
	for(int i=1;i<=n;++i) if(a[i]^b[i]){ f[a[i]]=a[i]; f[b[i]]=b[i]; }
	f[a[n+1]]=a[n+1];f[b[n+1]]=b[n+1];
	for(int fa,fb,i=1;i<=n+1;++i) 
		if(a[i]^b[i]){
			if(i<=n) ++ans;
			fa=find(a[i]); 
			fb=find(b[i]);
			f[fa]=fb;
		}
	for(int fi,i=1;i<=al;++i){
		fi=find(i); 
		if(fi==i)	++ans;
	}
	ans-1>0 ? ans-=1 : ans=0;
	printf("%d",ans);
	return 0;
}