#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

vector< int > z_algorithm(const vector< int > &s) {
  vector< int > prefix(s.size());
  for(int i = 1, j = 0; i < s.size(); i++) {
    if(i + prefix[i - j] < j + prefix[j]) {
      prefix[i] = prefix[i - j];
    } else {
      int k = max(0, j + prefix[j] - i);
      while(i + k < s.size() && s[k] == s[i + k]) ++k;
      prefix[i] = k;
      j = i;
    }
  }
  prefix[0] = (int) s.size();
  return prefix;
}

int main() {
  int N;
  cin >> N;
  vector< int > A(N), B(N);
  cin >> A >> B;
  // bitごとに独立

  auto solve = [&](vector< int > A, vector< int > B) {
    vector< int > ans;
    for(int i = 0; i < N; i++) {
      B.emplace_back(A[i]);
    }
    for(int i = 0; i < N; i++) {
      B.emplace_back(A[i]);
    }
    auto Z = z_algorithm(B);
    for(int i = 0; i < N; i++) {
      if(Z[i + N] >= N) {
        ans.emplace_back(i);
      }
    }
    return ans;
  };

  vector< int > ok(N);
  vector< int > bit(N);

  for(int i = 29; i >= 0; i--) {
    vector< int > C(N), D(N);
    for(int j = 0; j < N; j++) {
      C[j] = (A[j] >> i) & 1;
      D[j] = (B[j] >> i) & 1;
    }
    auto latte = solve(C, D);
    for(int j = 0; j < N; j++) {
      D[j] ^= 1;
    }
    auto malta = solve(C, D);
    for(auto &p : latte) ok[p]++;
    for(auto &p : malta) ok[p]++;

  }
  for(int i = 0; i < N; i++) {
    if(ok[i] == 30) {
      cout << i << " " << (A[i] ^ B[0]) << endl;
    }
  }
}



Measured memory_bytes: 15152