//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

#define N 100010

//head

int n;
int a[N], b[N];
bool flag;
vi zaatu;
int cnt[N], a_[N], b_[N];
int pl[N];
vi pp[N];
ll ans;
int bit[N];
void add(int i, int x) {
  while(i <= n) {
    bit[i] += x;
    i += i&-i;
  }
}
int sum(int i) {
  int res = 0;
  while(i) {
    res += bit[i];
    i &= i-1;
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  if(a[0] != b[0] or a[n-1] != b[n-1]) flag = true;
  rep(i, n-1) zaatu.emplace_back(a[i]^a[i+1]);
  sort(all(zaatu));
  zaatu.erase(unique(all(zaatu)), zaatu.end());
  rep(i, n-1) {
    int now = a[i]^a[i+1];
    auto itr = lower_bound(all(zaatu), now);
    a_[i] = itr-zaatu.begin();
    cnt[a_[i]]++;
    pp[a_[i]].emplace_back(i);
  }
  for(int i = n-2; i >= 0; i--) {
    int now = b[i]^b[i+1];
    auto itr = lower_bound(all(zaatu), now);
    if(itr == zaatu.end() or *itr != now) {
      flag = true;
      break;
    }
    b_[i] = itr-zaatu.begin();
    cnt[b_[i]]--;
    pl[i] = pp[b_[i]][cnt[b_[i]]];
  }
  rep(i, zaatu.size()) if(cnt[i]) flag = true;
  if(flag) {
    cout << -1 << endl;
    return 0;
  }
  rep(i, n-1) {
    ans += i-sum(pl[i]);
    add(pl[i]+1, 1);
  }

  cout << ans << endl;
}