#include <bits/stdc++.h>
#define NO  puts("-1"),exit(0)
using namespace std;

const int N=100010;
int n,m,a[N],b[N],c[2*N],ufs[2*N],ans;
map <int,int> M;

int find(int x){return ufs[x]==x?x:ufs[x]=find(ufs[x]);}

void work()
{
	scanf("%d",&n);
	for (int i=1; i<=n; i++)  scanf("%d",&a[i]),a[0]^=a[i];
	for (int i=1; i<=n; i++)  scanf("%d",&b[i]),b[0]^=b[i];
	for (int i=0; i<=n; i++)
		if (a[i]!=b[i])
			M[a[i]]++,M[b[i]]--,c[++m]=a[i],c[++m]=b[i];
	for (map <int,int> ::iterator x=M.begin(); x!=M.end(); x++)
		if ((*x).second)  NO;
	sort(c+1,c+m+1),m=unique(c+1,c+m+1)-c-1;
	for (int i=1; i<=n; i++)  a[i]=lower_bound(c+1,c+m+1,a[i])-c;
	for (int i=1; i<=n; i++)  b[i]=lower_bound(c+1,c+m+1,b[i])-c;
	ans=m;
	for (int i=1; i<=m; i++)  ufs[i]=i;
	for (int i=1; i<=n; i++)
		if (a[i]!=b[i])
			{
				if (find(a[i])!=find(b[i]))  ufs[find(a[i])]=find(b[i]);
				else  ans++;
			}
	for (int i=1; i<=m; i++)  if (c[i]==a[0])  ans--;
	printf("%d",ans);
}

int main()
{
	work();
	return 0;
}
