#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n;
int a[maxn], b[maxn];
int s;
map<int, int> mp;
vector<int> g[maxn];
int ans;
int vis[maxn];
void dfs(int x) {
  vis[x] = 1;
  for (int i = 0; i < g[x].size(); i++) {
    int v = g[x][i];
    if (!vis[v]) {
      dfs(v);
    }
  }
}
int res;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), s ^= a[i], mp[a[i]]++;
  mp[s]++;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &b[i]);
    if (!mp.count(b[i])) {
      puts("-1");
      return 0;
    }
    if (!mp[b[i]]) {
      puts("-1");
      return 0;
    }
    mp[b[i]]--;
  }
  for (int i = 1; i <= n; i++)
    if (mp[a[i]]) res = a[i];
  if (!res) res = s;
  for (int i = 1; i <= n; i++) {
    if (a[i] == b[i]) continue;
    ans++;
    g[a[i]].push_back(b[i]);
  }
  g[s].push_back(res);
  ans++;
  for (int i = 1; i <= n; i++) {
    if (!vis[i] && g[i].size()) dfs(i), ans++;
  }
  printf("%d", ans - 2);
  return 0;
}
