#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], c[N], d[N], t[N], f[N];
int get(int x) {
  if (f[x] == x) return x;
  return f[x] = get(f[x]);
}
int main() {
  int n;
  scanf("%d", &n);
  int x = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    x = x ^ a[i];
  }
  a[n + 1] = x;
  int y = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &b[i]);
    y = y ^ b[i];
  }
  b[n + 1] = y;
  for (int i = 1; i <= n + 1; i++) {
    c[i] = a[i];
    d[i] = b[i];
  }
  sort(c + 1, c + n + 2);
  sort(d + 1, d + n + 2);
  for (int i = 1; i <= n + 1; i++) {
    if (c[i] != d[i]) {
      if (i <= n) {
        puts("-1");
        return 0;
      }
      break;
    }
  }
  int ans = 0, num = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] != b[i] || i == n) {
      if (i < n) ans++;
      if (!t[a[i]]) num++, t[a[i]] = num;
      if (!t[b[i]]) num++, t[b[i]] = num;
    }
  }
  if (ans == 0) {
    puts("0");
    return 0;
  }
  for (int i = 1; i <= num; i++) f[i] = i;
  for (int i = 1; i <= n; i++)
    if (a[i] != b[i]) f[get(a[i])] = get(b[i]);
  for (int i = 1; i <= num; i++)
    if (f[i] == i) ans++;
  printf("%d\n", ans - 1);
}
