#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
map<int, int> h;
int n, a[maxn], b[maxn], c[maxn], d[maxn], tot, ans, p[maxn];
int findp(int t) { return p[t] ? p[t] = findp(p[t]) : t; }
void merge(int u, int v) {
  u = findp(u);
  v = findp(v);
  u != v ? p[u] = v : 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[0] ^= a[i];
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]), b[0] ^= b[i];
  for (int i = 0; i <= n; i++) c[i] = a[i], d[i] = b[i];
  sort(c, c + n + 1);
  sort(d, d + n + 1);
  for (int i = 0; i <= n; i++)
    if (c[i] != d[i]) {
      puts("-1");
      return 0;
    }
  for (int i = 1; i <= n; i++)
    if (a[i] != b[i]) {
      (!h[a[i]]) ? h[a[i]] = ++tot : 0;
      (!h[b[i]]) ? h[b[i]] = ++tot : 0;
      merge(h[a[i]], h[b[i]]);
      ++ans;
    }
  for (int i = 1; i <= tot; i++) ans += (p[i] == 0);
  printf("%d", ans ? ans - 1 : ans);
  return 0;
}
