#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

vl sorted(vl a) {
    sort(ALL(a));
    return a;
}

const int N = 2e5 + 10;

namespace DSU {
    int parent[N];
    int sz[N];
    int cnt[N];

    void make_set(int v) {
        parent[v] = v;
        sz[v] = 1;
    }

    int find_set(int v) {
        return parent[v] == v ? v : parent[v] = find_set(parent[v]);
    }

    void union_sets(int u, int v) {
        u = find_set(u);
        v = find_set(v);
        if (u == v)
            return;
        if (sz[u] < sz[v])
            swap(u, v);
        sz[u] += sz[v];
        parent[v] = u;
        cnt[u] += cnt[v];
    }
}

void smain() {

    int n;
    cin >> n;
    vl a(n);
    ll x = 0;
    fori (i, n) {
        cin >> a[i];
        x ^= a[i];
    }
    a.push_back(x);
    x = 0;
    vl b(n);
    fori (i, n) {
        cin >> b[i];
        x ^= b[i];
    }
    b.push_back(x);
    n++;
    if (sorted(a) != sorted(b)) {
        cout << "-1\n";
        return;
    }

    vl tmp = sorted(a);


    for (auto & x : a) {
        x = lower_bound(ALL(tmp), x) - tmp.begin();
    }
    for (auto & x : b) {
        x = lower_bound(ALL(tmp), x) - tmp.begin();
    }
    for (int i = 0; i < tmp.size(); ++i) {
        DSU::make_set(i);
    }
    fori (i, n) if (a[i] != b[i]) {
        DSU::union_sets(a[i], b[i]);
        int u = DSU::find_set(a[i]);
        DSU::cnt[u]++;
    }

    ll ans = 0;

    fori (i, tmp.size()) {
        if (DSU::parent[i] == i && DSU::cnt[i]) {
            ans += DSU::cnt[i] + 1;
            if (DSU::find_set(a[n - 1]) == i) {
                if (a[n - 1] == b[n - 1])
                    ans--;
                else
                    ans -= 2;
            }
        }
    }
    cout << ans;

}

Measured memory_bytes: 5972