// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N, A[MAXN], B[MAXN];

void input()
{
    read(N);
    for (int i = 1; i <= N; ++i) read(A[i]);
    for (int i = 1; i <= N; ++i) read(B[i]);
}

int fa[MAXN];
bool flag[MAXN];

int getFather(int u) { return fa[u] == u ? u : fa[u] = getFather(fa[u]); }

void solve()
{
    int t1 = 0, t2 = 0;
    for (int i = 1; i <= N; ++i) t1 ^= A[i];
    for (int i = 1; i <= N; ++i) t2 ^= B[i];
    A[++N] = t1; B[N] = t2;

    // for (int i = 1; i <= N; ++i) printf("%d ", A[i]); puts("");
    // for (int i = 1; i <= N; ++i) printf("%d ", B[i]); puts("");

    static int A0[MAXN], B0[MAXN];
    std::copy(A + 1, A + N + 1, A0 + 1); std::sort(A0 + 1, A0 + N + 1);
    std::copy(B + 1, B + N + 1, B0 + 1); std::sort(B0 + 1, B0 + N + 1);
    for (int i = 1; i <= N; ++i) if (A0[i] != B0[i]) { puts("-1"); return; }
    int N0 = std::unique(A0 + 1, A0 + N + 1) - A0 - 1;
    for (int i = 1; i <= N; ++i) A[i] = std::lower_bound(A0 + 1, A0 + N0 + 1, A[i]) - A0;
    for (int i = 1; i <= N; ++i) B[i] = std::lower_bound(A0 + 1, A0 + N0 + 1, B[i]) - A0;

    int ans = 0;
    for (int i = 1; i < N; ++i) ans += (A[i] != B[i]);
    for (int i = 1; i <= N; ++i) fa[A[i]] = A[i];
    for (int i = 1; i <= N; ++i) {
        if (getFather(A[i]) != getFather(B[i])) {
            fa[getFather(A[i])] = getFather(B[i]);
            flag[getFather(B[i])] = true;
        }
    }
    for (int i = 1; i <= N; ++i) ans += (getFather(A[i]) == A[i] && getFather(A[N]) != A[i] && flag[A[i]]);

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("D.in", "r", stdin);
    freopen("D.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 只愿君心似我心，定不负相思意。
//     -- 李之仪《卜算子·我住长江头》


Measured memory_bytes: 3840