#include<cstdio> 
#include<algorithm>
#include<map>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100000+10;
map<int,int> f;
int a[maxn],b[maxn],c[maxn],d[maxn],fa[maxn*2];
int i,j,k,l,t,n,m,tot,ans;
int getfa(int x){
    return fa[x]==x?x:fa[x]=getfa(fa[x]);
}
int main(){
    scanf("%d",&n);
    fo(i,1,n) scanf("%d",&a[i]);
    fo(i,1,n) scanf("%d",&b[i]);
    t=0;
    fo(i,1,n) t^=a[i];
    a[n+1]=t;
    t=0;
    fo(i,1,n) t^=b[i];
    b[++n]=t;
    fo(i,1,n) c[i]=a[i],d[i]=b[i];
    sort(c+1,c+n+1);
    sort(d+1,d+n+1);
    fo(i,1,n+1)
        if (i>n||c[i]!=d[i]) break;
    if (i<=n){
        printf("-1\n");
        return 0;
    }
    fo(i,1,n)
        if (a[i]!=b[i]||i==n){
            if (i<n) ans++;
            if (!f[a[i]]) f[a[i]]=++tot;
            if (!f[b[i]]) f[b[i]]=++tot;
        }
    if (!ans){
        printf("0\n");
        return 0;
    }
    fo(i,1,tot) fa[i]=i;
    fo(i,1,n)
        if (a[i]!=b[i]) fa[getfa(f[a[i]])]=getfa(f[b[i]]);
    fo(i,1,tot)
        if (fa[i]==i) ans++;
    printf("%d\n",ans-1);
}