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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
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;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

struct BIT {
  using Val = int;
  int n;
  vector<Val> tree;
  BIT(int n):n(n),tree(n+1) {}
  void fill(Val val) {
    REP(i, n+1) tree[i] = (i&-i) * val;
  }
  void add(int idx, Val val) {
    for (int x=idx+1; x<=n; x+=x&-x) tree[x] += val;
  }
  // sum[0, idx]
  Val range(int idx) {
    Val sum=0;
    for (int x=idx+1; x>0; x-=x&-x) sum += tree[x];
    return sum;
  }
  // sum[a, b]
  Val range(int a, int b) {
    return range(b) - range(a - 1);
  }
};

ll inversion_number(const vector<int>& A, int N) {
  ll ans = 0;
  BIT bit(N + 5);
  REP(i, N) {
    ans += bit.range(N - A[i]);
    bit.add(N - A[i], 1);
  }
  return ans;
}

int main2() {
  int N = nextLong();
  vector<int> A(N), B(N);
  REP(i, N) A[i] = nextLong();
  REP(i, N) B[i] = nextLong();

  vector<int> AA(N-1), BB(N-1);
  REP(i, N-1) AA[i] = A[i] ^ A[i+1];
  REP(i, N-1) BB[i] = B[i] ^ B[i+1];

  {
    vector<int> AAA = AA;
    vector<int> BBB = BB;
    sort(ALL(AAA));
    sort(ALL(BBB));
    if (AAA != BBB) {
      cout << -1 << endl;
      return 0;
    }
  }

  // pv(ALL(AA));
  // pv(ALL(BB));

  map<int, vector<int>> pos;
  REP(i, N-1) {
    pos[ BB[i] ].push_back(i);
  }

  vector<int> v(N-1);
  for (int i = AA.size() - 1; i >= 0; i--) {
    int k = pos[AA[i]].back();
    pos[AA[i]].pop_back();
    v[i] = k;
  }
  // pv(ALL(v));

  ll ans = inversion_number(v, N-1);
  cout << ans << endl;
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}