#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const ll INF = 1 << 30;//10^9
ll MOD = 1000000007;
ll base = 998244353;
//ll MOD = 998244353;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A, ll x = 10){cout << fixed << setprecision(x) << A << endl;}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};

//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}



struct RollingHash{
  vector<ll> S;
  ll sl;//Sのサイズ
  vector<ll> hashed, power;
  void getS(vector<ll> T){
    S = T;
    sl = S.size();
    hashed.resize(sl + 1, 0);
    power.resize(sl + 1);
    power[0] = 1;
    rep(i, sl){
      power[i+1] = (power[i] * base) % MOD;
      hashed[i+1] = (hashed[i] * base + S[i]) % MOD;
    }
  }

  ll make_HasH(vector<ll> T){
    ll res = 0;
    rep(i, T.size()){
      res = (res * base + T[i]) % MOD;
    }
    return res;
  }

  ll getHash(ll l, ll r){//[l, r)
    ll res = ((hashed[r] - hashed[l] * power[r-l]) % MOD + MOD) % MOD;
    return res;
  }
};



void solve(){
  ll N;
  cin >> N;
  vector<ll> A(N), B(N);
  rep(i, N) cin >> A[i];
  rep(i, N) cin >> B[i];
  rep(i, N) A[i] *= 2;
  rep(i, N) B[i] *= 2;
  vector<ll> C(N), D(2 * N);
  rep(i, N){
    C[i] = A[i] ^ A[(i+1)%N];
    D[i] = B[i] ^ B[(i+1)%N];
  }
  rep(i, N){
    D[i+N] = D[i];
  }
  RollingHash RA;
  RollingHash RB;
  RA.getS(C);
  ll hash = RA.getHash(0, N);
  RB.getS(D);
  vector<pair<ll, ll>> ans;
  revrep(i, N){
    if(hash == RB.getHash(i, i+N)){
      ans.pb({(N-i) % N, ((A[0] / 2) ^ (B[i] / 2))});
    }
  }
  sort(ans.begin(), ans.end());
  rep(i, ans.size()){
    cout << ans[i].f << " " << ans[i].s << endl;
  }

}


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 32556