#include <bits/stdc++.h> #define int long long using namespace std; int fa[100005], sz[100005], a[100005], b[100005], sum; unordered_map<int, int> mp, id; inline int find(int x) { return fa[x] != x ? fa[x] = find(fa[x]) : x; } inline void mg(int x, int y) { x = find(x), y = find(y), fa[find(x)] = find(y), sz[x] += y; } signed main() { int n; scanf("%lld", &n); for (int i = 1; i <= n; i++) { scanf("%lld", &a[i]); fa[i] = i, mp[a[i]]++, sum ^= a[i]; } for (int i = 1; i <= n; i++) { scanf("%lld", &b[i]); mp[b[i]]--; } mp[sum]++; int cnt = 0; for (auto p : mp) { if (p.second < 0) { puts("-1"); return 0; } id[p.first] = ++cnt; } int ans = 0; for (int i = 1; i <= n; i++) { if (a[i] == b[i]) continue; mg(id[a[i]], id[b[i]]); ans++; } mp.clear(); for (int i = 1; i <= cnt; i++) if (sz[find(i)] > 1) mp[find(i)]++; if (sz[find(sum)] > 1) ans--; printf("%lld", ans + mp.size()); return 0; }