#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
int ans;
int a[maxn];
int b[maxn];
int P[maxn];
vector<int> bois;
set<int> badbois;
map<int, vector<int>> inds[2];
void in();
void solve();
void out();
int main() {
  ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  in();
  solve();
  out();
}
void in() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> b[i];
}
void solve() {
  int hold = 0;
  for (int i = 0; i < n; i++) {
    hold ^= a[i];
    if (a[i] != b[i]) {
      inds[0][a[i]].push_back(i);
      inds[1][b[i]].push_back(i);
      bois.push_back(b[i]);
    }
  }
  inds[0][hold].push_back(n);
  sort(bois.begin(), bois.end());
  bois.resize(unique(bois.begin(), bois.end()) - bois.begin());
  for (auto i : bois) {
    if (inds[1][i].size() > inds[0][i].size()) {
      ans = -1;
      return;
    }
    for (int j = 1; j <= inds[1][i].size(); j++) {
      P[inds[0][i][inds[0][i].size() - j]] = inds[1][i][j - 1] + 1;
      badbois.insert(inds[0][i][inds[0][i].size() - j]);
    }
  }
  int now = n;
  while (badbois.size()) {
    ans++;
    if (P[now]) {
      badbois.erase(now);
      now = P[now] - 1;
    } else
      now = *badbois.begin();
  }
}
void out() { cout << ans; }
