#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T>
using Graph = vector<vector<T>>;
template <typename T>
using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"};
template <typename T>
struct is_plural : false_type {};
template <typename T1, typename T2>
struct is_plural<pair<T1, T2>> : true_type {};
template <typename T>
struct is_plural<vector<T>> : true_type {};
template <typename T>
struct is_plural<complex<T>> : true_type {};
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;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  if (vec.empty()) return os;
  bool pl = is_plural<T>();
  os << vec.front();
  for (auto itr = ++vec.begin(); itr != vec.end(); ++itr)
    os << interval[pl] << *itr;
  return os;
}
bool CoutYN(bool a, string y = "Yes", string n = "No") {
  cout << (a ? y : n) << "\n";
  return a;
}
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);
}
long long modpow(int a, long long n, int mod = MOD) {
  long long ret = 1;
  do {
    if (n & 1) ret = ret * a % mod;
    a = 1LL * a * a % mod;
  } while (n >>= 1);
  return ret;
}
template <typename T>
T GCD(T a, T b) {
  return b ? GCD(b, a % b) : a;
}
template <typename T>
T LCM(T a, T b) {
  return a / GCD(a, b) * b;
}
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
  return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T1, typename T2>
bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) {
  return a.first != b.first ? a.first < b.first : a.second > b.second;
}
template <typename T>
struct Compress {
  vector<T> xs;
  Compress() = default;
  Compress(const vector<T> &vs) { add(vs); }
  Compress(const initializer_list<vector<T>> &vs) {
    for (auto &p : vs) add(p);
  }
  void add(const vector<T> &vs) { copy(begin(vs), end(vs), back_inserter(xs)); }
  void add(const T &x) { xs.emplace_back(x); }
  void build() {
    sort(begin(xs), end(xs));
    xs.erase(unique(begin(xs), end(xs)), end(xs));
  }
  vector<int> get(const vector<T> &vs) const {
    vector<int> ret;
    transform(begin(vs), end(vs), back_inserter(ret), [&](const T &x) {
      return lower_bound(begin(xs), end(xs), x) - begin(xs);
    });
    return ret;
  }
  int get(const T &x) const {
    return lower_bound(begin(xs), end(xs), x) - begin(xs);
  }
  const T &operator[](int k) const { return xs[k]; }
};
struct UnionFind {
  vector<int> data;
  UnionFind(int sz) { data.assign(sz, -1); }
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }
  int find(int k) {
    if (data[k] < 0) return k;
    return (data[k] = find(data[k]));
  }
  int size(int k) { return -data[find(k)]; }
};
void solve() {
  int n;
  cin >> n;
  vi a(n), b(n);
  cin >> a >> b;
  auto impossible = []() {
    cout << -1 << endl;
    exit(0);
  };
  int x = 0;
  unordered_multiset<int> ms;
  for (auto &k : a) {
    x ^= k;
    ms.emplace(k);
  }
  bool exist = ms.count(x);
  ms.emplace(x);
  int y = 0;
  for (auto &k : b) {
    y ^= k;
    auto itr = ms.find(k);
    if (itr == ms.end()) impossible();
    ms.erase(ms.find(k));
  }
  if (*begin(ms) != y) impossible();
  Compress<int> comp;
  for (int i = 0; i < (int)(n); ++i)
    if (a[i] != b[i]) comp.add(a[i]);
  if (x != y) comp.add(x);
  comp.build();
  int sz = comp.xs.size();
  UnionFind uf(sz);
  int ans = 0;
  for (int i = 0; i < (int)(n); ++i)
    if (a[i] != b[i]) uf.unite(comp.get(a[i]), comp.get(b[i])), ++ans;
  if (x != y)
    uf.unite(comp.get(x), comp.get(y)), --ans;
  else if (exist)
    --ans;
  for (int i = 0; i < (int)(sz); ++i)
    if (uf.find(i) == i) ++ans;
  cout << ans << endl;
}
signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}
