/* Headers */
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <cctype>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define FOR(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define ROF(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define FORL(i,a,b,c) for(long long i=(a);i<=(b);i+=(c))
#define ROFL(i,a,b,c) for(long long i=(a);i>=(b);i-=(c))
#define FORR(i,a,b,c) for(register int i=(a);i<=(b);i+=(c))
#define ROFR(i,a,b,c) for(register int i=(a);i>=(b);i-=(c))
#define RevEdge(x) x^1
#define lowbit(x) x&(-x)
#define LeftChild(x) x<<1
#define RightChild(x) (x<<1)+1
#define CLOSE_IN() fclose(stdin);
#define CLOSE_OUT() fclose(stdout);
#define FILE_IN(x) freopen(x,"r",stdin);
#define FILE_OUT(x) freopen(x,"w",stdout);
#define IOS(x) std::ios::sync_with_stdio(x)
#define Dividing() printf("-----------------------------------\n");
namespace FastIO {
#define gc() (iS == iT ? (iT = (iS = ibuff) + fread(ibuff, 1, SIZ, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
    const int SIZ = 1 << 21 | 1;
    char* iS, * iT, ibuff[SIZ], obuff[SIZ], * oS = obuff, * oT = oS + SIZ - 1, fu[110], cc;
    int fr;
    inline void out() {
        fwrite(obuff, 1, oS - obuff, stdout);
        oS = obuff;
    }
    template<class Type>
    inline void read(Type& x) {
        x = 0;
        Type y = 1;
        for (cc = gc(); (cc > '9' || cc < '0') && cc != '-'; cc = gc());
        cc == '-' ? y = -1 : x = (cc & 15);
        for (cc = gc(); cc >= '0' && cc <= '9'; cc = gc())
            x = x * 10 + (cc & 15);
        x *= y;
    }
    template<class Type>
    inline void print(Type x, char text = '\n') {
        if (x < 0)
            * oS++ = '-', x *= -1;
        if (x == 0)
            * oS++ = '0';
        while (x)
            fu[++fr] = x % 10 + '0', x /= 10;
        while (fr);
            * oS++ = fu[fr--];
        * oS++ = text;
        out();
    }
    inline void prints(char x[], char text = '\n') {
        for (register int i = 0; x[i]; ++i)
            * oS++ = x[i];
        * oS++ = text;
        out();
    }
}
using namespace FastIO;
template<typename T>
inline T max(T a, T b) {return (a > b) ? a : b;}
template<typename T>
inline T min(T a, T b) {return (a > b) ? b : a;}
/* definitions */
const int MAXN = 1e5 + 10;
int UFS[MAXN], n, a[MAXN], b[MAXN], res, c[MAXN], d[MAXN], cnt;
std::unordered_map<int, int> shq;
/* functions */
inline int Find(int x) {
    if(x == UFS[x]) return x;
    return UFS[x] = Find(UFS[x]);
}
int main(int argc, char *argv[]) {
    /*FILE_IN("data.in");*/ read(n); n++;
    FOR(i, 1, n - 1, 1) read(a[i]), a[n] ^= a[i];
    FOR(i, 1, n - 1, 1) read(b[i]), b[n] ^= b[i];
    FOR(i, 1, n, 1) c[i] = a[i], d[i] = b[i];
    std::sort(c + 1, c + n + 1); std::sort(d + 1, d + n + 1);
    FOR(i, 1, n, 1) if(c[i] != d[i]) return puts("-1") & 0;
    if(n == 1) return puts("0") & 0;
    FOR(i, 1, n, 1) {
        if(a[i] != b[i] || i == n) {
            if(i != n) res++;
            if(!shq[a[i]]) shq[a[i]] = ++cnt;
            if(!shq[b[i]]) shq[b[i]] = ++cnt;
        }
    } FOR(i, 1, cnt, 1) UFS[i] = i;
    FOR(i, 1, n, 1) if(a[i] != b[i]) UFS[Find(shq[a[i]])] = Find(shq[b[i]]);
    FOR(i, 1, cnt, 1) if(UFS[i] == i) res++; printf("%d\n", res - 1);
    return 0;
}


Measured memory_bytes: 13396