#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
#include<numeric>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define REP(i, n) for(int i = 0;i < (n);i++)
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint inf=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}




int main(void){
	int n,i,gen;cin>>n;
	vector<int>Asa(n-1);
	vector<int>Bsa(n-1);
	int sg;
	cin>>gen;sg=gen;
	for(i=0;i<n-1;i++){
		int now;cin>>now;
		Asa[i]=now^gen;
		gen=now;
	}
	cin>>gen;
	if(sg!=gen){cout<<-1<<endl;return 0;}
	for(i=0;i<n-1;i++){
		int now;cin>>now;
		Bsa[i]=now^gen;
		gen=now;
	}
	vector<pair<int,int>>SB(n-1);
	
	for(i=0;i<n-1;i++){SB[i]=mp(Bsa[i],i);}
	SO(SB);
	static int seg[262144]={};
	llint ans=0;
	for(i=0;i<n-1;i++){
		int p=LBI(SB,mp(Asa[i],0));
		if(p>=n||SB[p].fir!=Asa[i]){cout<<-1<<endl;return 0;}
		int bas=SB[p].sec+131072;
		SB[p].fir--;
		SB[p].sec+=n;
		
		while(bas>1){
			seg[bas]++;
			if(bas%2==0){ans+=seg[bas+1];}
			bas/=2;
		}
		
	}
	cout<<ans<<endl;
	
	return 0;
}
/*
a b c
a abc c
*/