#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
const int maxn = 1e5 + 55;
int n, e, c, sz = 0;
int a[maxn], b[maxn], vis[maxn];
map<int, int> id, cnt;
vi g[maxn];
int getid(int x) { return id[x] = (id.count(x) ? id[x] : sz++); }
void add_edge(int u, int v) {
  e++;
  g[u].push_back(v);
  g[v].push_back(u);
}
void dfs(int v) {
  vis[v] = 1;
  for (int i : g[v])
    if (!vis[i]) dfs(i);
}
void solve() {
  for (int i = 0; i < sz; i++)
    if (!vis[i]) c++, dfs(i);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i], a[0] ^= a[i], cnt[a[i]]++;
  for (int i = 1; i <= n; i++) cin >> b[i], b[0] ^= b[i], cnt[b[i]]--;
  cnt[a[0]]++, cnt[b[0]]--;
  for (auto i : cnt)
    if (i.second) return cout << -1, 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] != b[i]) add_edge(getid(a[i]), getid(b[i]));
  }
  int zero = 1;
  for (int i = 0; i < n; i++) zero &= a[i] == b[i];
  if (zero) return cout << 0, 0;
  getid(a[0]);
  getid(b[0]);
  solve();
  cout << e + c - 1;
}
