#include<cstdio>
#include<algorithm>
using namespace std;
const int N=100010;
int n,ck=2,suma,sumb,tota,totb,fxor,ans,cnt,f[N],[N],b[N],lsha[N],lshb[N];
int find(int x){
	return x==f[x]?x:f[x]=find(f[x]);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",a+i);
		lsha[i]=a[i];
		suma^=a[i];
	}
	for(int i=1;i<=n;i++){
		scanf("%d",b+i);
		lshb[i]=b[i];
		sumb^=b[i];
		if(a[i]!=b[i])
			ans++;
	}
	if(!ans){
		puts("0");
		return 0;
	}
	++n;
	lsha[n]=a[n]=suma,lshb[n]=b[n]=sumb;
	sort(lsha+1,lsha+n+1);
	sort(lshb+1,lshb+n+1);
	for(int i=1;i<=n;i++){
		if(lsha[i]!=lshb[i]){
			puts("-1");
			return 0;
		}
	}
	tota=unique(lsha+1,lsha+n+1)-(lsha+1);
	for(int i=1;i<=tota;i++)
		f[i]=i;
	for(int i=1;i<=n;i++){
		int x=lower_bound(lsha+1,lsha+tota+1,a[i])-lsha,y=lower_bound(lsha+1,lsha+tota+1,b[i])-lsha;
		int fx=find(x),fy=find(y);
		if(fx!=fy)
			f[fx]=fy;
	}
	fxor=find(lower_bound(lsha+1,lsha+n+1,suma)-lsha);
	for(int i=1;i<=n;i++){
		int fi=find(i);
		if(i==fi&&a[i]!=b[i])
			cnt++;
		if(fi==fxor)
			ck--;
	}
	printf("%d",ans+max(ck,0)+max(cnt-1,0));
	return 0;
}