#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    invkaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
    rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
    if(a<b)return 0;
    if(a<0||b<0)return 0;
    return kaijo[a]*modpow(kaijo[a-b],mod-2)%mod*modpow(kaijo[b],mod-2)%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}
struct RollingHash{
    const int MASK30=(1ll<<30)-1;
    const int MASK31=(1ll<<31)-1;
    const int MOD=(1ll<<61)-1;
    int Base=9973;
    vector<int>hash,power;
    int calcmod(int x){
        int res=(x>>61)+(x&MOD);
        if(res>=MOD)res-=MOD;
        return res;
    }
    int mul(int a,int b){
		int au=a>>31;
		int ad=a&MASK31;
		int bu=b>>31;
		int bd=b&MASK31;
		int mid=ad*bu+au*bd;
		int midu=mid>>30;
		int midd=mid&MASK30;
		return calcmod(au*bu*2+midu+(midd<<31)+ad*bd);
	}
    RollingHash(vector<int>s,int base){
        //Base=Random(1<<7,1<<9)
        Base=base;
        int n=s.size();
        hash.resize(n+1,0);
        power.resize(n+1,1);
        rep(i,n){
            hash[i+1]=(mul(hash[i],Base)+s[i])%MOD;
            power[i+1]=mul(power[i],Base)%MOD;
        }
    }
    int get_hash(int l,int r){
        //[l,r)
        return (hash[r]-mul(hash[l],power[r-l])+MOD)%MOD;
    }
    int lcp(int x,int y){
        //Longest Common Prefix
        // [x,n) , [y,n)
        //Returns Maximum Length
        int len=min(hash.size()-y,hash.size()-x);
        int ok=0,ng=len+1;
        while(ng-ok>1){
            int mid=(ok+ng)/2;
            if(get_hash(x,x+mid)==get_hash(y,y+mid))ok=mid;
            else ng=mid;
        }
        return ok;
    }
    int lcs(int x,int y){
        //Longest Common Suffix
        // [0,x) , [0,y)
        //Returns Maximum Length
        int len=min(x,y);
        int ok=0,ng=len+1;
        while(ng-ok>1){
            int mid=(ok+ng)/2;
            if(get_hash(x-mid,x)==get_hash(y-mid,y))ok=mid;
            else ng=mid;
        }
        return ok;
    }
};
signed main(){
    cin.tie(0);ios::sync_with_stdio(false);
    int n;
    cin>>n;
    vector<int>a(2*n),b(2*n),c,d;
    rep(i,n)cin>>a[i];
    rep(i,n)cin>>b[i];
    rep(i,2*n)c.pb(a[i%n]^a[(i+1)%n]);
    rep(i,n)d.pb(b[i%n]^b[(i+1)%n]);
    RollingHash R(c,9973),S(d,9973);
    int all=S.get_hash(0,n-1);
    rep(k,n){
        if(R.get_hash(k,k+n-1)==all){
            cout<<k<<" "<<(a[k]^b[0])<<endl;
        }
    }
    return 0;
}

Measured memory_bytes: 25908