// May this submission get accepted
#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(DUMPALL_ITR, (q).size()) { cerr << (q)[DUMPALL_ITR] << (DUMPALL_ITR == DUMPALL_ITR_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(T a, T b) { if (a < b) std::swap(a, b); while (b) std::swap(a %= b, b); return a; }
template<class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using  ld = long double;
using namespace std;

// 標準入出力
struct inp {
    size_t sz;
    inp(size_t _sz = 1) : sz(_sz) {}
    template <typename T> operator T () const { T a; cin >> a; return a; }
    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
inp inp1; // input one
template <typename T> void say(T &x, char end = '\n') { cout << x << end; }
template <typename T> void say(vector<T> &x, char sep = ' ', char end = '\n') { for (size_t i = 0, sz = x.size(); i < sz; i++) { cout << x[i] << (i == sz-1 ? end : sep); } }

// モジュール
template <class RandomAccessIterator>
vector<ll> common_prefix(RandomAccessIterator first, RandomAccessIterator last) {
    const ll sz = last - first;
    vector<ll> prefix(sz, 0);
    for (ll i = 1, j = 0; i < sz; i++) {
        if (i + prefix[i-j] < j + prefix[j]) {
            prefix[i] = prefix[i-j];
        } else {
            ll k = max(0LL, j + prefix[j] - i);
            while (i + k < sz && *(first + k) == *(first + (i+k))) k++;
            prefix[i] = k;
            j = i;
        }
    }
    prefix[0] = sz;
    return prefix;
}

// 処理内容
int main() {
    
    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること
    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること
    
    ll n = inp1;
    vector<ull> a = inp(n);
    vector<ull> b = inp(n);

    vector<ull> ax = a, bx = b;
    REP(i, n) {
        ll j = (i+1)%n;
        ax[i] = a[i] ^ a[j];
        bx[i] = b[i] ^ b[j];
    }

    auto pf = common_prefix(ALL_OF(ax));
    vector<ll> period;
    REP(i, n) if (pf[i] == n - i) period.push_back(i);

    vector<pair<ll, ll>> ans; ans.reserve(n);
    
    vector<ll> zs; zs.reserve(n);
    REP(i, n) if (ax[0] == bx[i]) zs.push_back(i);
    for (ll &i : zs) {
        bool okay = true;
        REP(k, n) {
            if (ax[k] != bx[(i+k)%n]) {
                okay = false;
                break;
            }
        }
        for (ll w : period) {
            ans.emplace_back((n-i-w)%n, a[0] ^ b[i+w]);
        }
        break;
    }
    sort(ALL_OF(ans));
    for (auto &p : ans) {
        cout << p.first << " " << p.second << endl;
    }
    
}

Measured memory_bytes: 17648