#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

#include <functional>
#include <climits>

//SegmentTree<int> seg(N,[](int a,int b){return min(a,b);},INT_MAX);
template< typename T>
class SegmentTree{
public:

  using F = function<T(T,T)>;

  int n;
  vector<T> tree;
  F operation;
  T def;

  SegmentTree(int size,F _operation,T _def):operation(_operation),def(_def){
    n=1;
    while(n<size) n*=2;
    tree.resize(2*n-1,def);
  }

  SegmentTree(){}

  void embody(int size,F _operation,T _def){
    operation=_operation;
    def=_def;
    n=1;
    while(n<size) n*=2;
    tree.resize(2*n-1,def);
  }

  void initialize(vector<T> v){
    int vSize=v.size();
    n=1;
    while(n<vSize) n*=2;
    tree.resize(2*n-1,def);

    for(int i=0;i<vSize;i++) tree[i+n-1]=v[i];
    for(int i=n-2;i>=0;i--) tree[i]=operation(tree[2*i+1],tree[2*i+2]);
  }

  void update(int index,T value){
    index+=n-1;

    tree[index]=value;
    while(index>0){
      index=(index-1)/2;
      tree[index]=operation(tree[2*index+1],tree[2*index+2]);
    }
  }

  T query(int a,int b,int k=0,int l=0,int r=-1){//[a,b),getMin(a,b,0,0,-1)
    if(r<0) r=n;

    if(r<=a||b<=l) return def;
    else if(a<=l&&r<=b) return tree[k];
    else{
      T lval=query(a,b,2*k+1,l,(l+r)/2);
      T rval=query(a,b,2*k+2,(l+r)/2,r);
      return operation(lval,rval);
    }
  }

  int find(int x,int k=0,int l=0,int r=-1){// a[0]+...+a[i]>=x (i:minimal)
    if(r<0) r=n;
    if(r-l==1) return k-(n-1);
    if(tree[2*k+1]>=x) return find(x,2*k+1,l,(l+r)/2);
    else return find(x-tree[2*k+1],2*k+2,(l+r)/2,r);
  }
};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<ll> A(N),B(N);
  rep(i,N) cin>>A[i];
  rep(i,N) cin>>B[i];

  if(A[0]!=B[0]||A.back()!=B.back()){
    cout<<-1<<endl;
    return 0;
  }

  vector<ll> C(N-1,0),D(N-1,0);
  rep(i,N-1) C[i]=A[i]^A[i+1];
  rep(i,N-1) D[i]=B[i]^B[i+1];

  {
    vector<ll> a=C,b=D;
    sort(all(a));
    sort(all(b));
    if(a!=b){
      cout<<-1<<endl;
      return 0;
    }
  }
  vector<ll> v=C;
  sort(all(v));
  v.erase(unique(v.begin(),v.end()),v.end());
  int V=v.size();
  map<ll,int> mp;
  rep(i,V) mp[v[i]]=i;

  vector<int> X(N-1,0);
  vector<vector<int>> idxs(V);
  rep(i,N-1) idxs[mp[C[i]]].push_back(i);
  int cnt=0;
  rep(i,V) for(auto n:idxs[i]) X[n]=cnt++;
  vector<int> Y(N-1,0);
  idxs.clear();
  idxs.resize(V);
  rep(i,N-1) idxs[mp[D[i]]].push_back(i);
  cnt=0;
  rep(i,V) for(auto n:idxs[i]) Y[n]=cnt++;

  vector<int> trans(N-1,0);
  rep(i,N-1) trans[X[i]]=i;
  rep(i,N-1) Y[i]=trans[Y[i]];

  SegmentTree<int> seg(N-1,[](int a,int b){return a+b;},0);
  ll ans=0;
  for(int i=0;i<N-1;i++){
    ll val=seg.query(Y[i],N-1);
    ans+=val;
    seg.update(Y[i],1);
  }
  cout<<ans<<endl;

  return 0;
}