#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
// mt19937 rng(61378913);
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
// const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
 
ll mpow(ll base, ll exp, ll mod) {
  ll res = 1;
  while (exp) {
  if (exp % 2 == 1){
    res = (res * base) % mod;
  }
  exp >>= 1;
  base = (base * base) % mod;
  }
  return res;
}
ll minv(ll base, ll mod) {
  return mpow(base, mod - 2, mod);
}
 
ll n, m, k, q, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

vpl seq;

void solve(int tc) {
  cin >> n; ai(a, n); ai(b, n);
  f0r(i, n) a[i + n] = a[i];

  ll ba[2] = {0};
  ba[0] = (1LL << 30) + 177;
  ba[1] = ba[0] + 180;
  ll md[2] = {0};
  md[0] = 2038074743;
  md[1] = 2059519669;

  ll h[2] = {0};

  int pos = -1;

  ll bh[2] = {0};
  ll r[2]; r[0] = r[1] = 1;
  f0r(i, n) {
    ll v;
    if (i < n - 1) v = b[i] ^ b[i + 1];
    else v = b[0] ^ b[n - 1];
    f0r(j, 2) {
      ll ov = (r[j] * v) % md[j];
      bh[j] = (bh[j] + ov) % md[j];
      r[j] = (r[j] * ba[j]) % md[j];
    }
  }

  r[0] = r[1] = 1;
  f0r(i, n) {
    ll v = a[i] ^ a[i + 1];
    f0r(j, 2) {
      ll ov = (r[j] * v) % md[j];
      h[j] = (h[j] + ov) % md[j];
      r[j] = (r[j] * ba[j]) % md[j];
    }
  }

  ll mi[2];
  f0r(j, 2) mi[j] = minv(ba[j], md[j]);

  bool f = 1;
  f0r(j, 2) if (h[j] != bh[j]) f = 0;
  if (f) pos = 0;
  else {
    f0r(i, n - 1) {
      ll v = a[i] ^ a[i + 1];
      f0r(j, 2) {
        h[j] = (h[j] - v + md[j]) % md[j];
      }
      f0r(j, 2) {
        ll ov = (r[j] * v) % md[j];
        h[j] = (h[j] + ov) % md[j];
        h[j] = (h[j] * mi[j]) % md[j];
      }

      f = 1;
      f0r(j, 2) if (h[j] != bh[j]) f = 0;
      if (f) {
        pos = i + 1;
        break;
      }
    }
  }

  if (pos == -1) return;

  f1r(i, 1, n + 1) {
    if (n % i == 0) {
      bool f = 1;
      f0r(j, n) {
        if ((a[j] ^ a[j + 1]) != (a[j % i] ^ a[j % i + 1])) {
          f = 0;
          break;
        }
      }
      if (f) {
        for (ll j = pos; j < n; j += i) {
          seq.pb(mp(j, a[pos + j] ^ b[pos]));
        }
        break;
      }
    }
  }

  for (pll x: seq) cout << x.f << " " << x.s << '\n';
}

int main() {
  send help
 
  // usaco("file");
 
  int tc;
  tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
} 

Measured memory_bytes: 17900