#include <bits/stdc++.h>
using namespace std;
namespace std {
template <class S, class T>
struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T>
struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v) h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
}  // namespace std
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < (int)v.size(); i++)
    os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v) os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v) os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
void isIdentical(vector<int> a, vector<int> b) {
  sort((a).begin(), (a).end());
  sort((b).begin(), (b).end());
  if (a != b) {
    cout << -1 << endl;
    exit(0);
  }
}
int shrink(vector<int> &a, vector<int> &b) {
  int n = a.size() - 1;
  vector<int> c, d;
  for (int i = 0; i < (int)n; i++)
    if (a[i] != b[i]) {
      c.push_back(a[i]);
      d.push_back(b[i]);
    }
  c.push_back(a[n]);
  d.push_back(b[n]);
  map<int, int> id;
  int k = 0;
  for (int i = 0; i < (int)c.size(); i++)
    if (!id.count(c[i])) id[c[i]] = k++;
  for (int i = 0; i < (int)c.size(); i++) {
    c[i] = id[c[i]];
    d[i] = id[d[i]];
  }
  a = c;
  b = d;
  return k;
}
bool done[100010];
int p[100010];
int root(int x) {
  if (p[x] < 0) return x;
  return p[x] = root(p[x]);
}
void merge(int a, int b) {
  a = root(a);
  b = root(b);
  if (a != b) {
    p[a] += p[b];
    p[b] = a;
  }
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int n;
  cin >> n;
  assert(n > 2);
  vector<int> a(n + 1), b(n + 1);
  for (int i = 0; i < (int)n; i++) {
    cin >> a[i];
    a[n] ^= a[i];
  }
  for (int i = 0; i < (int)n; i++) {
    cin >> b[i];
    b[n] ^= b[i];
  }
  isIdentical(a, b);
  int N = shrink(a, b);
  for (int i = 0; i < (int)N; i++) p[i] = -1;
  for (int i = 0; i < (int)a.size(); i++) merge(a[i], b[i]);
  int r = root(a.back()), ans = 0;
  for (int i = 0; i < (int)a.size(); i++) {
    int rt = root(a[i]);
    if (done[rt]) continue;
    done[rt] = 1;
    ans -= p[rt];
    if (r == rt)
      ans--;
    else
      ans++;
  }
  ans += a.size() - N;
  cout << ans << endl;
  return 0;
}
