#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
#define MN 200005
using namespace std;
int n,a[MN],b[MN],ans,num,head[MN],tt,sum[MN];
struct edge{int to,next;}g[MN];
map<int,int>mp;bool vis[MN];
void ins(int u,int v){g[++num].next=head[u];head[u]=num;g[num].to=v;}
void dfs(int u){vis[u]=1;for(int i=head[u];i;i=g[i].next)if(!vis[g[i].to])dfs(g[i].to);}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),a[n+1]^=a[i];
	for(int i=1;i<=n;i++)scanf("%d",&b[i]),b[n+1]^=b[i];
	for(int i=1;i<=n+1;i++)mp[a[i]]++,mp[b[i]]--;
	for(int i=1;i<=n+1;i++)if(mp[a[i]]){puts("-1");return 0;}
	for(int i=1;i<=n+1;i++)if(!mp[a[i]])mp[a[i]]=++tt;
	for(int i=1;i<=n+1;i++)if(a[i]!=b[i])ins(mp[a[i]],mp[b[i]]),ans++,++sum[mp[a[i]]];
	for(int i=1;i<=tt;i++)if(!vis[i]&&sum[i])dfs(i),ans++;
	ans-=(sum[mp[a[n+1]]]!=0)+(a[n+1]!=b[n+1]);
	printf("%d\n",ans);
	return 0;
}