#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#define MN 101000

int a[MN], b[MN];
int c[MN], d[MN];
int s = 0, s2 = 0;
bool vis[MN];
std::vector<int> v[MN];
bool ok = 1;
int ans = 0, now = 0;

void dfs(int x)
{
	if(vis[x]) return; 
	vis[x] = 1;
	now += v[x].size();
	if(c[x] == s) ok = 0;
	for(auto &y : v[x]) dfs(y);
}

int main()
{
	int n; scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]), s ^= a[i], c[i] = a[i];
	for(int i = 1; i <= n; i++) scanf("%d", &b[i]), s2 ^= b[i], d[i] = b[i];
	c[n + 1] = s; d[n + 1] = s2;
	std::sort(c + 1, c + n + 2);
	std::sort(d + 1, d + n + 2);
	for(int i = 1; i <= n + 1; i++) if(c[i] != d[i]) return 0 * puts("-1");
	int N = std::unique(c + 1, c + n + 2) - c - 1;
	for(int i = 1; i <= n; i++)
	{
		int A = std::lower_bound(c + 1, c + N + 1, a[i]) - c;
		int B = std::lower_bound(c + 1, c + N + 1, b[i]) - c;
		if(A != B) v[A].push_back(B), v[B].push_back(A);
	}
	for(int i = 1; i <= N; i++)
		if(!vis[i]) 
		{
			now = 0; ok = 1;
			dfs(i);
			if(now) ans += now / 2 + ok;
		}
	printf("%d\n", ans);
}
