#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//
constexpr ll MOD = 1e9 + 7;
/*/
const ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

// https://github.com/beet-aizu/library/blob/master/string/knuth_morris_pratt.cpp
// longest prefix suffix matching of [0, i)
vector<int> KMPTable(const string &s) {
  int n = s.size();
  vector<int> kmp(n + 1, -1), mp(n + 1, -1);
  for (int i = 0, j = -1; i < n; i++) {
    while (~j && s[i] != s[j])
      j = kmp[j];
    kmp[i + 1] = mp[i + 1] = ++j;
    if (i + 1 < n && s[i + 1] == s[j])
      kmp[i + 1] = kmp[j];
  }
  return mp;
}
// smallest d s.t. s[x] == s[x + d] for all x
vector<int> minimum_period(const string &s) {
  int n = s.size();
  vector<int> mp = KMPTable(s);
  for (int i = 1; i < n; i++)
    mp[i] = i - mp[i];
  return mp;
}


const ll btm = 30;

// positions for s that match t
vector<int> KMPSearch(const string &s, const string &t) {
  int n = s.size(), m = t.size();
  vector<int> kmp = KMPTable(t);

  vector<int> res(SZ(s));
  int i = 0, j = 0;
  while (i + j < n) {
    if (t[j] == s[i + j]) {
      if (++j != m)
        continue;
      res[i] = 1;
    }
    i += j - kmp[j];
    j = max(kmp[j], 0);
  }
  return res;
}


int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  vll a(n);
  rep(i, n){
    cin >> a[i];
  }
  vll b(n);
  rep(i, n){
    cin >> b[i];
  }
  vs ast(btm*2);
  vs bst(btm);
  rep(i, btm){
    rep(j, 2*n-1){
      ast[i] += ((a[j%n] >> i) & 1) + '0';
      ast[i+btm] += (1 - ((a[j%n] >> i) & 1)) + '0';
    }
    rep(j, n){
      bst[i] += ((b[j%n] >> i) & 1) + '0';
    }
  }
  vvi res(btm*2);
  rep(i, btm*2){
    res[i] = KMPSearch(ast[i], bst[i%btm]);
    dump(res[i]);
  }
  vi flg(n, 0);
  vll ans(n, 0);
  rep(i, n){
    bool f = 1;
    rep(j, btm){
      f &= res[j][i] | res[j+btm][i];
      if(res[j+btm][i]){
        ans[i] += (1ll << j);
      }
    }
    flg[i] = f;
  }
  dump(flg);
  rep(i, n){
    if(flg[i]){
      print(i, ans[i]);
    }
  }
}


Measured memory_bytes: 133100