#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

// coordinate compression
struct X {
  typedef int T;
  vector<T> d;
  void add(T x) { d.pb(x);}
  void init() {
    sort(rng(d));
    d.erase(unique(rng(d)), d.end());
  }
  int size() const { return sz(d);}
  int operator[](int i) const { return d[i];}
  int operator()(T x) const { return upper_bound(rng(d),x)-d.begin()-1;}
};
//

vvi to, ot;
vi used;
void dfs(int v) {
  if (used[v]) return;
  used[v] = 1;
  for (int u : to[v]) {
    dfs(u);
  }
  for (int u : ot[v]) {
    dfs(u);
  }
}

int main() {
  int n;
  scanf("%d",&n);
  vi a(n), b(n);
  cin>>a>>b;
  if (a == b) {
    puts("0");
    return 0;
  }
  int x = 0;
  rep(i,n) x ^= a[i];
  X xs;
  rep(i,n) xs.add(a[i]);
  rep(i,n) xs.add(b[i]);
  xs.add(x);
  xs.init();
  int m = sz(xs);
  to = ot = vvi(m);
  int ans = 0;
  rep(i,n) {
    if (a[i] == b[i]) continue;
    ++ans;
    to[xs(b[i])].pb(xs(a[i]));
    ot[xs(a[i])].pb(xs(b[i]));
  }
  int cnt = 0;
  rep(i,m) {
    if (sz(to[i]) < sz(ot[i])) cnt++;
    if (sz(to[i]) > sz(ot[i]) && xs[i] != x) cnt = INF;
    if (abs(sz(to[i])-sz(ot[i])) > 1) cnt = INF;
  }
  if (cnt > 1) dame;
  int com = 0;
  used = vi(m);
  dfs(xs(x));
  rep(i,m) {
    if (used[i]) continue;
    if (sz(to[i]) == 0) continue;
    com++;
    dfs(i);
  }
  ans += com;
  cout<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 16244