#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = (int)1e8 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 1e5 + 5;
int n;
int a[maxn];
int b[maxn];
map<int, int> hs;
void solve() {
  cin >> n;
  for (int i = (0); i < (n); i++) cin >> a[i];
  for (int i = (0); i < (n); i++) cin >> b[i], hs[b[i]]++;
  int s = 0;
  for (int i = (0); i < (n); i++) hs[a[i]]--, s ^= a[i];
  int c = 0;
  for (__typeof((hs).begin()) it = (hs).begin(); it != (hs).end(); it++) {
    if (abs(it->second) >= 2) {
      cout << -1 << "\n";
      return;
    }
    if (it->second == 1) c++;
  }
  if (c > 1) {
    cout << -1 << "\n";
    return;
  }
  if (c && hs[s] != 1) {
    cout << -1 << "\n";
    return;
  }
  int dif = 0;
  for (int i = (0); i < (n); i++) dif += a[i] != b[i];
  if (!dif) {
    cout << 0 << "\n";
    return;
  }
  int ans = INF;
  if (!c) {
    cout << dif + 1 << "\n";
    return;
  }
  for (int i = (0); i < (n); i++) {
    int tmp = dif;
    if (hs[a[i]] == -1) {
      tmp -= a[i] != b[i];
      tmp += s != b[i];
      if (!tmp) {
        chkmin(ans, 1);
      } else {
        chkmin(ans, tmp + 2);
      }
    }
  }
  cout << ans << "\n";
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
    ios_base::sync_with_stdio(0), cin.tie(0);
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
