#include <bits/stdc++.h>

using namespace std;

using ll = int64_t;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using pii = pair<int, int>;
using ld = double;

#define X first
#define Y second

#define FWRITE

namespace io
{

#ifndef FWRITE
#include <unistd.h>
#endif
	const int BUFSIZE = 1 << 20;

	int isize, osize;
	char ibuf[BUFSIZE + 10], obuf[BUFSIZE + 10];
	char* is, * it, * os = obuf, * ot = obuf + BUFSIZE;

	char getchar()
	{
		if (is == it)
		{
			is = ibuf;
#ifdef FWRITE
			it = ibuf + fread(ibuf, 1, BUFSIZE, stdin);
#else
			it = ibuf + read(STDIN_FILENO, ibuf, BUFSIZE);
#endif
			if (is == it) return EOF;
		}
		return *is++;
	}

	char getalpha()
	{
		char c = getchar();
		while (!isalpha(c)) c = getchar();
		return c;
	}

	void putchar(char c)
	{
		*os++ = c;
		if (os == ot)
		{
#ifdef FWRITE
			fwrite(obuf, 1, BUFSIZE, stdout);
#else
			write(STDOUT_FILENO, obuf, BUFSIZE);
#endif
			os = obuf;
		}
	}

	int inp() {
		int x = 0, f = 0; char ch;
		for (ch = getchar(); !isdigit(ch); ch = getchar())
		{
			//if (ch == EOF) return -1;
			if (ch == '-') f = 1;
		}
		for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return f ? -x : x;
	}

	ll inp_ll() {
		ll x = 0; int f = 0; char ch;
		for (ch = getchar(); !isdigit(ch); ch = getchar())
			if (ch == '-') f = 1;
		for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return f ? -x : x;
	}

	template<class T>
	bool read(T& x)
	{
		x = 0;
		char ch = getchar();
		if (ch == EOF) return 0;
		for (; !isdigit(ch); )
		{
			ch = getchar();
			if (ch == EOF) return 0;
		}
		for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return 1;
	}

	template<class T>
	void write(T x)
	{
		static char s[22];
		static char* it = s + 20;
		static char* end = s + 20;

		if (x < 0)
		{
			putchar('-');
			x = -x;
		}

		do
		{
			*--it = x % 10 + '0';
			x /= 10;
		} while (x);
		/*
		if (!x)
			*-- it = '0';
		while (x)
		{
			*-- it = x%10+'0';
			x /= 10;
		}
		*/
		for (; it < end; ++it)
			putchar(*it);
	}

	template<>
	void write(const char* s)
	{
		for (; *s; ++s) putchar(*s);
	}

	template<>
	void write(char c)
	{
		putchar(c);
	}

	template<class T, class V>
	void write(T x, V y)
	{
		write(x);
		write(y);
	}

	template<class T>
	void writeln(T x)
	{
		write(x);
		putchar('\n');
	}

	struct ender
	{
		~ender()
		{
			if (os != obuf)
#ifdef FWRITE
				fwrite(obuf, 1, os - obuf, stdout);
#else
				write(STDOUT_FILENO, obuf, os - obuf);
#endif
		}
	}__ender;

}

template<class T>
void print(const T& a)
{
	for (auto x : a) printf("%d ", x); puts("");
}

int64_t power(int64_t a, int64_t b, int64_t p)
{
	if (!b) return 1;
	int64_t t = power(a, b>>1, p);
	t = t * t % p;
	if (b & 1) t = t * a % p;
	return t;
}

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

using namespace io;

template<class T>
inline void freshmin(T& a, const T& b)
{
	if (a > b) a = b;
}

template<class T>
inline void freshmax(T& a, const T& b)
{
	if (a < b) a = b;
}

const ll B = 31;
const ll MOD = 1000000007;

const ll B2 = 37;
const ll MOD2 = 998244353;
const int MAXN = 100010;


void solve()
{
	int n = inp();
	vector<int> a(n*2+2);
	for (int i = 1; i <= n; ++i)
		a[i] = inp();
	auto ta = a;
	a[0] = a[n];
	for (int i = n; i >= 1; --i)
		a[i] = a[i] ^ a[i - 1];

	vector<int> b(2*n+2);
	for (int i = 1; i <= n; ++i)
		b[i] = b[i+n] = inp();
	auto tb = b;
	b[0] = b[n];
	for (int i = n * 2; i >= 1; --i)
		b[i] = b[i] ^ b[i - 1];

	vector<ll> h(2 * n + 2), h2(2*n+2);
	for (int i = 1; i <= n * 2; ++i)
	{
		h[i] = (h[i - 1] * B + b[i])%MOD;
		h2[i] = (h2[i - 1] * B2 + b[i]) % MOD2;
	}
	vector<ll> g(2 * n + 2), g2(2 * n + 2);
	for (int i = 1; i <= n * 2; ++i)
	{
		g[i] = (g[i - 1] * B + a[i]) % MOD;
		g2[i] = (g2[i - 1] * B2 + a[i]) % MOD2;
	}
	ll hash = g[n], hash2 = g2[n];
	vector<pair<int, int>> ans;
	for (int i = 2 * n - 1; i >= n; --i)
	{
		ll tmp = (h[i] - h[i - n] * power(B, n, MOD) % MOD + MOD) % MOD;
		ll tmp2 = (h2[i] - h2[i - n] * power(B2, n, MOD2) % MOD2 + MOD2) % MOD2;

		if (tmp == hash && tmp2 == hash2)
		{
			int k = (n - (i - n)) % n;
			ans.push_back({ k, ta[n] ^ tb[n - k] });
		}
	}
	sort(ans.begin(), ans.end());
	for (auto e : ans)
		printf("%d %d\n", e.X, e.Y);
}

int main()
{
	
	//for (int T = inp(); T --; )
	solve();

	return 0;
}

Measured memory_bytes: 24944