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

const int MaxN=1e5+5;

int N,K,Ans;
int A[MaxN],B[MaxN],X[MaxN],Y[MaxN],Tmp[MaxN<<1];
int Fa[MaxN];

int Get_Fa(int x){
	return x==Fa[x]?x:Fa[x]=Get_Fa(Fa[x]);
}

int main(){
	int i,r1,r2;
	scanf("%d",&N),N++;
	for(i=1;i<N;i++){
		scanf("%d",&A[i]);
		A[N]^=A[i];
	}
	for(i=1;i<N;i++){
		scanf("%d",&B[i]);
		B[N]^=B[i];
	}
	memmove(X,A,sizeof(X));
	memmove(Y,B,sizeof(Y));
	sort(X+1,X+N+1);
	sort(Y+1,Y+N+1);
	for(i=1;i<N;i++)
		if(X[i]^Y[i]){
			puts("-1");
			return 0;
		}
	for(i=1;i<=N;i++)
		if(A[i]^B[i]||i==N){
			Tmp[++K]=A[i],Tmp[++K]=B[i];
			Ans+=(i<N);
		}
	if(!Ans){
		puts("0");
		return 0;
	}
	sort(Tmp+1,Tmp+K+1);
	K=unique(Tmp+1,Tmp+K+1)-Tmp-1;
	for(i=1;i<=K;i++)
		Fa[i]=i;
	for(i=1;i<=N;i++)
		if(A[i]^B[i]){
			A[i]=lower_bound(Tmp+1,Tmp+K+1,A[i])-Tmp;
			B[i]=lower_bound(Tmp+1,Tmp+K+1,B[i])-Tmp;
			if((r1=Get_Fa(A[i]))^(r2=Get_Fa(B[i])))
				Fa[r1]=r2;
		}
	for(i=1;i<=K;i++)
		Ans+=(Get_Fa(i)==i);
	printf("%d\n",Ans-1);
	return 0;
}
### Prompt

Please create a solution in Cpp to 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 MaxN=1e5+5;

int N,K,Ans;
int A[MaxN],B[MaxN],X[MaxN],Y[MaxN],Tmp[MaxN<<1];
int Fa[MaxN];

int Get_Fa(int x){
	return x==Fa[x]?x:Fa[x]=Get_Fa(Fa[x]);
}

int main(){
	int i,r1,r2;
	scanf("%d",&N),N++;
	for(i=1;i<N;i++){
		scanf("%d",&A[i]);
		A[N]^=A[i];
	}
	for(i=1;i<N;i++){
		scanf("%d",&B[i]);
		B[N]^=B[i];
	}
	memmove(X,A,sizeof(X));
	memmove(Y,B,sizeof(Y));
	sort(X+1,X+N+1);
	sort(Y+1,Y+N+1);
	for(i=1;i<N;i++)
		if(X[i]^Y[i]){
			puts("-1");
			return 0;
		}
	for(i=1;i<=N;i++)
		if(A[i]^B[i]||i==N){
			Tmp[++K]=A[i],Tmp[++K]=B[i];
			Ans+=(i<N);
		}
	if(!Ans){
		puts("0");
		return 0;
	}
	sort(Tmp+1,Tmp+K+1);
	K=unique(Tmp+1,Tmp+K+1)-Tmp-1;
	for(i=1;i<=K;i++)
		Fa[i]=i;
	for(i=1;i<=N;i++)
		if(A[i]^B[i]){
			A[i]=lower_bound(Tmp+1,Tmp+K+1,A[i])-Tmp;
			B[i]=lower_bound(Tmp+1,Tmp+K+1,B[i])-Tmp;
			if((r1=Get_Fa(A[i]))^(r2=Get_Fa(B[i])))
				Fa[r1]=r2;
		}
	for(i=1;i<=K;i++)
		Ans+=(Get_Fa(i)==i);
	printf("%d\n",Ans-1);
	return 0;
}
```