#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

vl kmp(const vl &T, const vl &P) {
  vl ans;
  if (P.empty())
    return ans;

  vector<ll> pi(P.size(), 0);
  for (ll i = 1, k = 0; i < P.size(); ++i) {
    while (k && P[k] != P[i])
      k = pi[k - 1];
    if (P[k] == P[i])
      ++k;
    pi[i] = k;
  }

  for (ll i = 0, k = 0; i < T.size(); ++i) {
    while (k && P[k] != T[i])
      k = pi[k - 1];
    if (P[k] == T[i])
      ++k;
    if (k == P.size()) {
      k = pi[k - 1];
      if (i - P.size() + 1 < P.size())
        ans.push_back(i - P.size() + 1);
      // return i - k + 1;
    }
  }

  return ans;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl A(N), B(N);
  vl DA(N * 2), DB(N);
  REP(i, N) cin >> A[i];
  REP(i, N) cin >> B[i];
  REP(i, 2 * N) {
    ll j = i % N;
    ll k = (i + 1) % N;
    DA[i] = A[j] ^ A[k];
  }
  REP(i, N) {
    ll j = i % N;
    ll k = (i + 1) % N;
    DB[i] = B[j] ^ B[k];
  }
  AUTO(k, kmp(DA, DB)) { cout << k << " " << (A[k] ^ B[0]) << endl; }

  return 0;
}


Measured memory_bytes: 13012