#include <bits/stdc++.h>
using namespace std;
int n, a[100005], b[100005], as[100005], bs[100005], al, bl, f[100005], ans;
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    as[i] = a[i];
    a[n + 1] ^= a[i];
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &b[i]);
    bs[i] = b[i];
    b[n + 1] ^= b[i];
  }
  as[n + 1] = a[n + 1];
  bs[n + 1] = b[n + 1];
  sort(as + 1, as + n + 2);
  al = unique(as + 1, as + n + 2) - (as + 1);
  sort(bs + 1, bs + n + 2);
  bl = unique(bs + 1, bs + n + 2) - (bs + 1);
  if (al ^ bl) {
    puts("-1");
    return 0;
  }
  for (int i = 1; i <= al; ++i)
    if (as[i] ^ bs[i]) {
      puts("-1");
      return 0;
    }
  for (int i = 1; i <= n + 1; ++i) {
    a[i] = lower_bound(as + 1, as + 1 + al, a[i]) - as;
    b[i] = lower_bound(bs + 1, bs + 1 + bl, b[i]) - bs;
  }
  for (int i = 1; i <= n; ++i)
    if (a[i] ^ b[i]) {
      f[a[i]] = a[i];
      f[b[i]] = b[i];
    }
  f[a[n + 1]] = a[n + 1];
  f[b[n + 1]] = b[n + 1];
  for (int fa, fb, i = 1; i <= n + 1; ++i)
    if (a[i] ^ b[i]) {
      if (i <= n) ++ans;
      fa = find(a[i]);
      fb = find(b[i]);
      f[fa] = fb;
    }
  for (int fi, i = 1; i <= al; ++i) {
    fi = find(i);
    if (fi == i) ++ans;
  }
  ans - 1 > 0 ? ans -= 1 : ans = 0;
  printf("%d", ans);
  return 0;
}
