#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, a[N], b[N], ca[N], cb[N], p[N], ans;
set<int> gm;
int find(int x) {
  while (p[x] != x) {
    p[x] = p[p[x]];
    x = p[x];
  }
  return x;
}
int main() {
  ans = 0;
  gm.clear();
  scanf("%d", &n);
  a[n] = b[n] = 0;
  for (int i = 0; i < N; i++) {
    p[i] = i;
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
    a[n] ^= a[i];
    ca[i] = a[i];
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", b + i);
    b[n] ^= b[i];
    cb[i] = b[i];
  }
  cb[n] = b[n];
  ca[n] = a[n];
  sort(ca, ca + n + 1);
  sort(cb, cb + n + 1);
  for (int i = 0; i < n + 1; i++) {
    if (ca[i] != cb[i]) {
      printf("-1");
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    if (a[i] != b[i]) {
      ans++;
      int x = find(a[i]);
      int y = find(b[i]);
      if (x != y) {
        p[x] = y;
      }
    }
  }
  int x = find(a[n]);
  int y = find(a[n]);
  if (x != y) p[x] = y;
  for (int i = 0; i < n + 1; i++) {
    if (a[i] != b[i] || i == n) gm.insert(find(a[i]));
  }
  ans += (int)gm.size();
  ans--;
  printf("%d", ans);
  return 0;
}
