//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  if (a < b) {
    return b - a;
  } else {
    return a - b;
  }
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a) {
    a = b;
  }
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b) {
    a = b;
  }
}
template <class F> class fix_point : private F {
public:
  explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) make_fix(F &&f) {
  return fix_point<F>(std::forward<F>(f));
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <cassert>
#include <cstdint>
#include <iterator>
#include <vector>

namespace n91 {

class m61_rolling_hash {
private:
  using u64 = std::uint_fast64_t;
  using size_t = std::size_t;

public:
  using value_type = u64;

private:
  static constexpr u64 pow2(const int exp) noexcept {
    return static_cast<u64>(1) << exp;
  }

  static constexpr u64 Mod = (static_cast<u64>(1) << 61) - 1;

  static constexpr u64 multiplies_plus(const u64 l, const u64 r,
                                       const u64 c) noexcept {
    const u64 ld = l % pow2(31);
    const u64 lu = l / pow2(31);
    const u64 rd = r % pow2(31);
    const u64 ru = r / pow2(31);
    const u64 m = ld * ru + lu * rd;
    u64 v = lu * ru * 2 + ld * rd + m % pow2(30) * pow2(31) + m / pow2(30) + c;
    v = v % pow2(61) + v / pow2(61);
    if (v >= Mod) {
      v -= Mod;
    }
    return v;
  }

  std::vector<u64> prefix;
  std::vector<u64> power;

public:
  m61_rolling_hash() = default;
  template <class C>
  explicit m61_rolling_hash(const C &c, const u64 base = 91)
      : prefix(), power() {
    const size_t n = c.size();
    prefix.reserve(n + 1);
    prefix.push_back(0);
    for (size_t i = 0; i != n; ++i) {
      prefix.push_back(multiplies_plus(prefix.back(), base, c[i]));
    }
    power.reserve(n + 1);
    power.push_back(Mod - 1);
    for (size_t i = 0; i != n; ++i) {
      power.push_back(multiplies_plus(power.back(), base, 0));
    }
  }

  u64 get(const size_t first, const size_t last) const noexcept {
    assert(first <= last);
    assert(last < prefix.size());
    return multiplies_plus(prefix[first], power[last - first], prefix[last]);
  }
  u64 operator()(const size_t first, const size_t last) const noexcept {
    assert(first <= last);
    assert(last < prefix.size());
    return get(first, last);
  }
};

} // namespace n91

#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  std::vector<u32> a(n), b(n);
  for (auto &e : a)
    std::cin >> e;
  for (auto &e : b)
    std::cin >> e;
  std::vector<u32> ans(n, 0);
  std::vector<bool> valid(n, true);
  for (const usize p : rep(0, 30)) {
    std::vector<u32> ap(n * 2), ar(n * 2), bp(n);
    for (const usize i : rep(0, n)) {
      ap[i] = a[i] >> p & 1;
      ap[n + i] = ap[i];
      ar[i] = ap[i] ^ 1;
      ar[n + i] = ar[i];
      bp[i] = b[i] >> p & 1;
    }
    const m61_rolling_hash aph(ap), arh(ar), bph(bp);
    for (const usize i : rep(0, n)) {
      if (aph(i, n + i) == bph(0, n)) {

      } else if (arh(i, n + i) == bph(0, n)) {
        ans[i] ^= static_cast<u32>(1) << p;
      } else {
        valid[i] = false;
      }
    }
  }
  for (const usize i : rep(0, n)) {
    if (valid[i]) {
      std::cout << i << " " << ans[i] << "\n";
    }
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 28452