#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define sz(s) (ll) s.size()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define debug(x) cerr << #x << " = " << (x) << endl;
#define loop(x)                                                                \
    LCIN(loop);                                                                \
    while(loop--) {                                                            \
        x;                                                                     \
    }
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define COMB(n, k)                                                             \
    for(ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))
#define PERM2(n, k)                                                            \
    COMB(n, k) {                                                               \
        vector<int> sel;                                                       \
        for(int bitindex = 0; bitindex < n; bitindex++)                        \
            if(bit >> bitindex & 1) sel.emplace_back(bitindex);                \
        PERM(sel) { Printv(sel); }                                             \
    }
#define MKORDER(n)                                                             \
    vector<int> od(n);                                                         \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&... tail) {
    cout << (head) << " ";
    COUT(forward<Tail>(tail)...);
}

#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    long long __VA_ARGS__;                                                     \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    VL __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define Printv(v)                                                              \
    {                                                                          \
        REP(hoge, v.size())                                                    \
        cout << v[hoge] << (hoge == v.size() - 1 ? "" : " ");                  \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

long long next_combination(long long sub) {
    long long x = sub & -sub, y = sub + x;
    return (((sub & ~y) / x) >> 1) | y;
}
template <class T> inline bool chmax(T &a, const T &b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// generic lambdas
template <typename first>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(first &&f) noexcept {
    return [f = std::forward<first>(f)](auto &&... args) {
        return f(f, std::forward<decltype(args)>(args)...);
    };
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793230
#define EPS 1e-7

class KMP {
  private:
    int len;

    /// @details pat 検索したいパターン
    VL pat;

    // table to use kmp
    vector<int> table;

  public:
    /// @param _pat 検索したいパターン
    KMP(const VL _pat) {
        len = _pat.size();
        pat = _pat;
        table = vector<int>(len + 1);
        make_table();
    }

    /// @details S[0, i)の文字列の 接頭辞と接尾辞の最大の共通の長さ(min(i-1))
    void make_table() {
        table[0] = -1;
        int j = -1;
        for(int i = 0; i < len; i++) {
            while(j >= 0 && pat[i] != pat[j]) j = table[j];
            table[i + 1] = ++j;
        }
    }

    /// @param S patが含まれる文字列
    /// @details pstがSに含まれる位置のvectorを返す
    vector<int> kmp(const VL &S) {
        vector<int> ret;
        int m = 0, i = 0, n = S.size();
        while(m + i < n) {
            if(pat[i] == S[m + i]) {
                if(++i == len) {
                    ret.push_back(m);
                    m = m + i - table[i];
                    i = table[i];
                }
            } else {
                m = m + i - table[i];
                if(i > 0) i = table[i];
            }
        }
        return ret;
    }

    /// @param S patが含まれる文字列
    /// @details pstがSに含まれる最初の位置を返す -1は含まれない
    int contain(const VL &S) {
        int m = 0, i = 0, n = S.size();
        while(m + i < n) {
            if(pat[i] == S[m + i]) {
                if(++i == len) {
                    return m;
                }
            } else {
                m = m + i - table[i];
                if(i > 0) i = table[i];
            }
        }
        return -1;
    }

    void show_table() {
        printf("i:");
        for(int i = 0; i <= len; i++) printf("%3d ", i);
        printf("\n");
        printf("R:");
        for(int i = 0; i <= len; i++) printf("%3d ", table[i]);
        printf("\n");
    }
};
void solve() {
    LCIN(N);
    VL a(N), b(N);
    VECCIN(a);
    VECCIN(b);
    VL dif;
    REP(i, N - 1) dif.emplace_back(b[i] ^ b[i + 1]);
    KMP kmp(dif);
    VL aa;
    REP(i, 2 * N) { aa.emplace_back(a[i % N] ^ a[(i + 1) % N]); }
    VL res = kmp.kmp(aa);
    VPL ans;
    FOREACH(idx, res) if(idx <= N - 1) ans.emplace_back(idx, a[idx] ^ b[0]);
    REP(i, sz(ans)) { COUT(ans[i].fi, ans[i].second); }
}

signed main() {
    cinfast();
    // cout << fixed << setprecision(12);
    // loop(solve());
    solve();
}


Measured memory_bytes: 24144