#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;

#define rep(i, x, y) for (i64 i = i64(x), i##_max_for_repmacro = i64(y); i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

template <i64 p>
class fp {
    public:
    i64 x;
    fp() : x(0) {}
    fp(i64 x_) : x((x_ % p + p) % p) {}
    fp operator+() const { return fp(x); }
    fp operator-() const { return fp(-x); }
    fp& operator+=(const fp& y) {
        x += y.x;
        if (x >= p) x -= p;
        return *this;
    }
    fp& operator-=(const fp& y) { return *this += -y; }
    fp& operator*=(const fp& y) {
        x = x * y.x % p;
        return *this;
    }
    fp& operator/=(const fp& y) { return *this *= fp(inverse(y.x)); }
    fp operator+(const fp& y) const { return fp(x) += y; }
    fp operator-(const fp& y) const { return fp(x) -= y; }
    fp operator*(const fp& y) const { return fp(x) *= y; }
    fp operator/(const fp& y) const { return fp(x) /= y; }
    bool operator==(const fp& y) const { return x == y.x; }
    bool operator!=(const fp& y) const { return !(*this == y); }
    i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
        i64 d = a;
        if (b != 0) {
            d = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
        } else {
            x = 1;
            y = 0;
        }
        return d;
    }
    i64 inverse(i64 a) {
        i64 x, y;
        extgcd(a, p, x, y);
        return (x % p + p) % p;
    }
};

template <i64 p>
i64 abs(const fp<p>& x) { return x.x; }

template <i64 p>
istream& operator>>(istream& is, fp<p>& x) {
    is >> x.x;
    return is;
}

template <i64 p>
ostream& operator<<(ostream& os, const fp<p>& x) {
    os << x.x;
    return os;
}

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

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << "[";
    for (const auto& v : vec) {
        os << v << ",";
    }
    os << "]";
    return os;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename A, typename T, size_t size>
void fill(A (&ary)[size], const T& val) {
    fill((T*)ary, (T*)(ary + size), val);
}

// x未満の要素の個数を返す
template <typename T>
i64 count_less(const vector<T>& v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

// x以下の要素の個数を返す
template <typename T>
i64 count_less_or_equal(const vector<T>& v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

// xより大きい要素の個数を返す
template <typename T>
i64 count_greater(const vector<T>& v, T x) {
    return end(v) - upper_bound(begin(v), end(v), x);
}

// x以上の要素の個数を返す
template <typename T>
i64 count_greater_or_equal(const vector<T>& v, T x) {
    return end(v) - lower_bound(begin(v), end(v), x);
}

// x未満の要素のうち最大のものを返す
template <typename T>
T max_less(const vector<T>& v, T x) {
    return *(lower_bound(begin(v), end(v), x) - 1);
}

// x以下の要素のうち最大のものを返す
template <typename T>
T max_less_or_equal(const vector<T>& v, T x) {
    return *(upper_bound(begin(v), end(v), x) - 1);
}

// xより大きい要素のうち最小のものを返す
template <typename T>
T min_greater(const vector<T>& v, T x) {
    return *upper_bound(begin(v), end(v), x);
}

// x以上の要素のうち最小のものを返す
template <typename T>
T min_greater_or_equal(const vector<T>& v, T x) {
    return *lower_bound(begin(v), end(v), x);
}

constexpr int inf = 1.01e9;
constexpr i64 inf64 = 4.01e18;
constexpr long double eps = 1e-9;

// 実数値のn分探索のループ回数の上限(2分探索なら50でも十分かもしれない)
constexpr i64 max_loop = 100;

long double tolerance(const long double& a, const long double& b, const long double& epsilon = eps) {
    return epsilon * max({1.l, abs(a), abs(b)});
}

// a<0なら-1, a==0なら0, a>0なら1
int sgn(const long double a, const long double& epsilon = eps) {
    return (a > epsilon) - (a < -epsilon);
}

// a<bなら-1, a==bなら0, a>bなら1
int compare(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return sgn(a - b, is_relative ? tolerance(a, b, epsilon) : epsilon);
}

// a==bか?
bool is_equal(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) == 0;
}

// a<bか?
bool is_less(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) == -1;
}

// a<=bか?
bool is_less_or_equal(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) <= 0;
}

// a>bか?
bool is_greater(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) == 1;
}

// a>=bか?
bool is_greater_or_equal(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) >= 0;
}

template<typename T>
struct rolling_hash {
    int mnum;
    T s;
    i64 base;
    std::vector<i64> mod;
    std::vector<vector<i64>> hash, pow;

    rolling_hash(const T& s, i64 base = 9973, std::vector<i64> mod = {999999937LL, 1000000007LL}) : mnum(mod.size()), s(s), base(base), mod(mod) {
        int size = s.size();
        hash = std::vector<std::vector<i64>>(mnum, std::vector<i64>(size + 1));
        pow = std::vector<std::vector<i64>>(mnum, std::vector<i64>(size + 1));

        for (int i = 0; i < mnum; ++i) {
            hash[i][0] = 0;
            pow[i][0] = 1;
        }
        for (int i = 0; i < mnum; ++i) {
            i64 m = mod[i];
            for (int j = 1; j < size + 1; ++j) {
                pow[i][j] = pow[i][j - 1] * base % m;
                hash[i][j] = (hash[i][j - 1] * base + s[j - 1]) % m;
            }
        }
    }

    i64 compute_hash(int l, int r, int i /* 何番目のmodにおけるハッシュを計算するか */) {  //[l,r)
        return (hash[i][r] - hash[i][l] * pow[i][r - l] % mod[i] + mod[i]) % mod[i];
    }

    // [l, r)を左方向に指定された回数だけ回転させた文字列のハッシュを計算する.
    i64 left_rotated_hash(int l,int r,int i /* 何番目のmodにおけるハッシュを計算するか */,int rotation /* 左方向に回転する回数 */){
        return (compute_hash(l,l+rotation,i)+compute_hash(l+rotation,r,i)*pow[i][rotation]%mod[i])%mod[i];
    }

    bool match(int l, int r, const std::vector<i64> &hs) {
        for (int i = 0; i < mnum; ++i)
            if (compute_hash(l, r, i) != hs[i]) return false;
        return true;
    }
};

typedef unsigned long long int ull;

void solve() {
    //constexpr i64 mod = 1'000'000'007;
    i64 N;
    cin >> N;

    vector<i64> a(N),b(N);
    rep(i,0,N) cin >> a[i];
    rep(i,0,N) cin >> b[i];

    vector<i64> s(N),t(N);
    rep(i,0,N) s[i]=a[i]^a[(i+1)%N];
    rep(i,0,N) t[i]=b[i]^b[(i+1)%N];

    rolling_hash<vector<i64>> sh(s),th(t);

    auto calc_hs=[&](i64 k){
        vector<i64> hs;
        rep(i, 0, sh.mod.size()) {
            hs.emplace_back(sh.left_rotated_hash(0,N,i,k));
        }
        return hs;
    };

    vector<i64> ks;
    rep(k,0,N){
        auto hs=calc_hs(k);
        if(th.match(0, N, hs)) ks.emplace_back(k);
    }

    vector<i64> xs(ks.size());
    rep(i,0,ks.size()){
        xs[i]=a[ks[i]]^b[0];
    }

    rep(i,0,ks.size()){
        cout << ks[i] << " " << xs[i] << endl;
    }
}

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    solve();
    return 0;
}


Measured memory_bytes: 29540