#include <bits/stdc++.h>
using namespace std;
int u[108000];
int done[108000];
int dig[108000];
int cnt;
void ng() {
  cout << -1 << endl;
  exit(0);
}
int r(int x) {
  if (x == u[x]) return x;
  return u[x] = r(u[x]);
}
void unite(int x, int y) {
  x = r(x);
  y = r(y);
  if (x != y) u[x] = y;
}
int n;
int main() {
  cin >> n;
  for (int i = 0; i < 108000; i++) u[i] = i;
  vector<int> a(n + 1), b(n + 1), c, d;
  a[n] = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[n] ^= a[i];
  }
  b[n] = 0;
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    b[n] ^= b[i];
  }
  c = a;
  d = b;
  sort(c.begin(), c.end());
  sort(d.begin(), d.end());
  if (c != d) {
    ng();
  }
  for (int i = 0; i <= n; i++) {
    if (a[i] == b[i]) continue;
    unite(a[i], b[i]);
    dig[a[i]]++;
    cnt++;
  }
  for (int i = 0; i <= n; i++) {
    if (a[i] == b[i]) continue;
    if (done[r(i)]) continue;
    done[r(i)] = true;
    cnt++;
  }
  if (a[n] != b[n])
    cnt -= 2;
  else if (dig[a[n]] > 0)
    cnt--;
  cout << cnt << endl;
  return 0;
}
