#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    vector<ll> B(N);
    rep(i, N) cin >> B[i];
    if (A[0] != B[0]){
        cout << -1 << endl;
        return 0;
    }
    if (A[N - 1] != B[N - 1]){
        cout << -1 << endl;
        return 0;
    }
    vector<ll> a_xor(N - 1);
    vector<ll> b_xor(N - 1);
    rep(i, N - 1){
        a_xor[i] = A[i] ^ A[i + 1];
        b_xor[i] = B[i] ^ B[i + 1];
    }
    // 集合が等しいかどうか？
    vector<ll> a_sorted(N - 1);
    vector<ll> b_sorted(N - 1);
    rep(i, N - 1){
        a_sorted[i] = a_xor[i];
        b_sorted[i] = b_xor[i];
    }
    sort(all(a_sorted));
    sort(all(b_sorted));
    rep(i, N - 1){
        if (a_sorted[i] != b_sorted[i]){
            cout << -1 << endl;
            return 0;
        }
    }
    map<ll, ll> mp;
    rep(i, N - 1){
        mp[a_sorted[i]]++;
    }
    ll now = 0;
    for (auto it = mp.begin(); it != mp.end(); it++){
        it->second = now;
        now++;
    }
    rep(i, N - 1){
        a_xor[i] = mp[a_xor[i]];
        b_xor[i] = mp[b_xor[i]];
    }
    debug(a_xor);
    debug(b_xor);
    
    vector<pll> pva(N - 1);
    rep(i, N - 1){
        pva[i] = make_pair(a_xor[i], i);
    }
    sort(all(pva));
    vector<ll> inva(N - 1);
    rep(i, N - 1){
        inva[pva[i].second] = i;
    }
    debug(inva);


    vector<pll> pvb(N - 1);
    rep(i, N - 1){
        pvb[i] = make_pair(b_xor[i], i);
    }
    sort(all(pvb));
    vector<ll> invb(N - 1);
    rep(i, N - 1){
        invb[pvb[i].second] = i;
    }
    debug(invb);
    
    vector<ll> num_inv(N - 1);
    rep(i, N - 1){
        num_inv[inva[i]] = i;
    }
    vector<ll> inv_vec(N - 1);
    rep(i, N - 1){
        inv_vec[i] = num_inv[invb[i]];
    }
    
    ll ans = 0;
    fenwick_tree<ll> bit(N - 1);
    rep(i, N - 1){
        ans += bit.sum(inv_vec[i] + 1, N - 1);
        bit.add(inv_vec[i], 1);
    }
    cout << ans << endl;
}