#include<bits/stdc++.h>
#define ll long long
#define R register
#define int long long
#define hash cnm
using namespace std;
const int N = 4e5+200;
const int base=1e9+7;
const int mod=998244353;
template <class Ruby> inline void read(Ruby &x)
{
	x=0;
	char ch=getchar(), w=0;
	while(!isdigit(ch))w=(ch=='-'), ch=getchar();
	while(isdigit(ch))x=(x<<1)+(x<<3)+(ch^48), ch=getchar();
	x=w?-x:x;
}

int n, a[N], b[N], ok[N];
int val[N], hash[N];
signed main()
{
	read(n);
	for(R int i=0; i<=n; i++)ok[i]=1;
	for(R int i=1; i<=n; i++)read(a[i]);
	for(R int i=1; i<=n; i++)read(b[i]), b[i+n]=b[i];
	for(R int i=0; i<=30; i++)
	{
		for(R int j=1; j<=n*2; j++)
		{
			hash[j]=(hash[j-1]*base+((b[j]>>i)&1))%mod;
		}
		int tmp0=0, tmp1=0, tmp2=1;
		for(R int j=1; j<=n; j++)
		{
			tmp0=((tmp0*base+((a[j]>>i)&1)))%mod;
			tmp1=((tmp1*base+((a[j]>>i)&1^1)))%mod;
			tmp2=tmp2*base%mod;
		}
		for(R int j=0; j<n; j++)
		{
			int v=((hash[n+j]-hash[j]*tmp2)%mod+mod)%mod;
//			cout<<i<<" "<<j<<" "<<v<<" "<<tmp0<<" "<<tmp1<<endl;
			if(tmp0 != v && tmp1 != v)
			{
				ok[n-j]=0;
			}
			else
			{
				if(tmp1==v)val[n-j]^=(1<<i);
			}
		}
	}
	if(ok[n])cout<<0<<" "<<val[n]<<endl;
	for(R int i=1; i<n; i++)
	{
		if(ok[i])
		{
			cout<<i<<" "<<val[i]<<"\n";
		}
	}
	return 0;
}