#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll n,seg[200010],INF = 1000000000000;
void init(){
    for(int i=n - 1;i>0;i--){
        seg[i] = seg[i<<1] + seg[i<<1|1];
    }
}

void update(int p,ll val){
    for(seg[p += n] = val;p>1;p>>=1){
        seg[p>>1] = seg[p] + seg[p^1];
    }
}

ll query(int l,int r){
    ll res = 0;
    for(l += n,r += n; l<r;l>>=1,r>>=1){
        if(l&1) res += seg[l++];
        if(r&1) res += seg[--r];
    }
    return res;
}

int a[100010],b[100010],c[100010],d[100010];
map<int,int> mp1,mp2,mp4;
map<int,vector<int>> mp3;
int main(){
    int i; cin >> n;
    for(i=0;i<n;i++) cin >> a[i];
    for(i=0;i<n;i++) cin >> b[i];
    if(a[0]!=b[0] || a[n - 1]!=b[n - 1]){
        cout << -1 << endl;
        return 0;
    }
    n--;
    for(i=0;i<n;i++){
        c[i] = a[i]^a[i + 1]; d[i] = b[i]^b[i + 1];
        mp1[c[i]]++; mp2[d[i]]++;
    }
    for(auto x:mp1){
        int y = x.first;
        if(mp2[y]!=x.second){
            cout << -1 << endl;
            return 0;
        }
    }
    for(i=0;i<n;i++) mp3[c[i]].push_back(i + 1);
    /*for(i=0;i<n;i++) cout << c[i] << " ";
    cout << endl;
    for(i=0;i<n;i++) cout << d[i] << " ";
    cout << endl;*/
    for(i=0;i<n;i++){
        int k = 0;
        if(mp4.find(d[i])!=mp4.end()) k = mp4[d[i]] + 1;
        //cout << k << " " << mp3[d[i]][k] << endl;
        mp4[d[i]] = k; d[i] = mp3[d[i]][k];
    }
    /*for(i=0;i<n;i++) cout << d[i] << " ";
    cout << endl;*/
    ll ans = 0;
    for(i=0;i<n;i++){
        update(d[i] - 1,1);
        ans += query(d[i],n);
    }
    cout << ans << endl;
}