#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
int n, a[M], b[M], x[M], y[M], vis[M], cnt, ans;
map<int, int> d;
vector<int> Q[M];
inline int read() {
  int f = 1, sum = 0;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    sum = (sum << 1) + (sum << 3) + (ch ^ 48);
    ch = getchar();
  }
  return f * sum;
}
inline void dfs(int x) {
  vis[x] = 1;
  for (int i = 0; i <= Q[x].size() - 1; i++) {
    if (!vis[Q[x][i]]) {
      dfs(Q[x][i]);
    }
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    a[n + 1] ^= a[i];
    if (!d[a[i]]) d[a[i]] = ++cnt;
  }
  if (!d[a[n + 1]]) d[a[n + 1]] = ++cnt;
  for (int i = 1; i <= n; i++) {
    b[i] = read();
    b[n + 1] ^= b[i];
    if (!d[b[i]]) d[b[i]] = ++cnt;
  }
  if (!d[b[n + 1]]) d[b[n + 1]] = ++cnt;
  memcpy(x, a, sizeof(x));
  memcpy(y, b, sizeof(y));
  sort(x + 1, x + n + 2);
  sort(y + 1, y + n + 2);
  for (int i = 1; i <= n; i++)
    if (x[i] != y[i]) {
      printf("-1");
      return 0;
    }
  for (int i = 1; i <= n + 1; i++) a[i] = d[a[i]], b[i] = d[b[i]];
  for (int i = 1; i <= n; i++)
    if (a[i] != b[i]) ans++, Q[a[i]].push_back(b[i]);
  if (a[n + 1] != b[n + 1]) Q[a[n + 1]].push_back(b[n + 1]);
  for (int i = 1; i <= cnt; i++)
    if (Q[i].size() && !vis[i]) dfs(i), ans++;
  printf("%d", ans - 1);
  return 0;
}
