#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int N = 1e5 + 10;
map<int, int> vis, mp;
int fa[N], a[N], b[N];
int find(int now) { return fa[now] == now ? now : fa[now] = find(fa[now]); }
int main() {
  int n, t = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i), vis[a[i]]++, t ^= a[i];
  vis[a[n + 1] = t]++;
  t = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", b + i), vis[b[i]]--, t ^= b[i];
    if (vis[b[i]] < 0) return puts("-1"), 0;
  }
  vis[b[n + 1] = t]--;
  if (vis[t] < 0) return puts("-1"), 0;
  int cnt = 0, lop = 0;
  for (int i = 1; i <= n + 1; i++)
    if (a[i] != b[i])
      if (!mp.count(a[i])) mp[a[i]] = ++cnt, fa[cnt] = cnt;
  for (int i = 1; i <= n + 1; i++)
    if (a[i] != b[i]) fa[find(mp[a[i]])] = find(mp[b[i]]);
  for (int i = 1; i <= cnt; i++)
    if (fa[i] == i) lop++;
  int ans = cnt + lop;
  if (a[n + 1] != b[n + 1]) ans -= 2;
  cout << ans << endl;
  return 0;
}
