#include <bits/stdc++.h>
using namespace std;

const int N=100005;

int n,tot,ans;
int a[N],b[N],c[N],d[N],f[N<<1];

map<int,int> mp;

int Find(int x){return f[x]==x?x:f[x]=Find(f[x]);}

void work()
{
	for(int i=1;i<=n;i++) if(c[i]!=d[i]){puts("-1");return ;}
	for(int i=1;i<=n;i++){
		if(a[i]!=b[i]||i==n)
		{
			ans+=i<n;
			if(!mp[a[i]]) mp[a[i]]=++tot;
			if(!mp[b[i]]) mp[b[i]]=++tot;
		}
	}
	if(!ans){puts("0");return ;}
	for(int i=1;i<=tot;i++) f[i]=i;
	for(int i=1;i<=n;i++) if(a[i]!=b[i]) f[Find(mp[a[i]])]=Find(mp[b[i]]);
	for(int i=1;i<=tot;i++) ans+=f[i]==i;
	printf("%d\n",ans-1);
}
 
void init()
{
	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];
	n++;for(int i=1;i<=n;i++) c[i]=a[i],d[i]=b[i];
	sort(c+1,c+1+n);sort(d+1,d+1+n);
}

int main()
{
    init();
    work();
    return 0;
}
### Prompt

Create a solution in Cpp for the following problem:

There is a sequence of length N: a = (a_1, a_2, ..., a_N). Here, each a_i is a non-negative integer.

Snuke can repeatedly perform the following operation:

* Let the XOR of all the elements in a be x. Select an integer i (1 ≤ i ≤ N) and replace a_i with x.



Snuke's objective is to match a with another sequence b = (b_1, b_2, ..., b_N). Here, each b_i is a non-negative integer.

Determine whether the objective is achievable, and find the minimum necessary number of operations if the answer is positive.

Constraints

* 2 ≤ N ≤ 10^5
* a_i and b_i are integers.
* 0 ≤ a_i, b_i < 2^{30}

Input

Input is given from Standard Input in the following format:


N
a_1 a_2 ... a_N
b_1 b_2 ... b_N


Output

If the objective is achievable, print the minimum necessary number of operations. Otherwise, print `-1` instead.

Examples

Input

3
0 1 2
3 1 0


Output

2


Input

3
0 1 2
0 1 2


Output

0


Input

2
1 1
0 0


Output

-1


Input

4
0 1 2 3
1 0 3 2


Output

5

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

const int N=100005;

int n,tot,ans;
int a[N],b[N],c[N],d[N],f[N<<1];

map<int,int> mp;

int Find(int x){return f[x]==x?x:f[x]=Find(f[x]);}

void work()
{
	for(int i=1;i<=n;i++) if(c[i]!=d[i]){puts("-1");return ;}
	for(int i=1;i<=n;i++){
		if(a[i]!=b[i]||i==n)
		{
			ans+=i<n;
			if(!mp[a[i]]) mp[a[i]]=++tot;
			if(!mp[b[i]]) mp[b[i]]=++tot;
		}
	}
	if(!ans){puts("0");return ;}
	for(int i=1;i<=tot;i++) f[i]=i;
	for(int i=1;i<=n;i++) if(a[i]!=b[i]) f[Find(mp[a[i]])]=Find(mp[b[i]]);
	for(int i=1;i<=tot;i++) ans+=f[i]==i;
	printf("%d\n",ans-1);
}
 
void init()
{
	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];
	n++;for(int i=1;i<=n;i++) c[i]=a[i],d[i]=b[i];
	sort(c+1,c+1+n);sort(d+1,d+1+n);
}

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