#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

#include "atcoder/fenwicktree.hpp"

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);
    vector<int> a(n),b(n); in(a,b);
    if(a[0] != b[0] || a[n-1] != b[n-1]) {
        out("-1");
        return 0;
    }
    vector<int> c(n-1),d(n-1);
    rep(i,n-1){
        c[i] = a[i] ^ a[i+1];
        d[i] = b[i] ^ b[i+1];
    }
    auto v = c, w = d;
    sort(ALL(v)); sort(ALL(w));
    if(v != w){
        out("-1");
        return 0;
    }
    UNIQUE(v); UNIQUE(w);
    rep(i,n-1){
        c[i] = lower_bound(ALL(v), c[i]) - v.begin();
        d[i] = lower_bound(ALL(w), d[i]) - w.begin();
    }
    int m = *max_element(ALL(d))+1;
    vector<vector<int>> q(m);
    rep(i,n-1){
        q[d[i]].pb(i);
    }
    vector<int> x;
    vector<int> idx_q(m);
    rep(i,n-1){
        x.pb(q[c[i]][idx_q[c[i]]]);
        idx_q[c[i]]++;
    }
    vector<vector<int>> pos(m);
    rep(i,n-1) pos[x[i]].pb(i);
    ll ans = 0;
    atcoder::fenwick_tree<ll> f(n-1);
    rep(i,m){
        for(int e : pos[i]){
            ans += f.sum(e+1,n-1);
        }
        for(int e : pos[i]){
            f.add(e,1);
        }
    }
    out(ans);
}