///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

template <typename TT, typename T>
void incr_m(map<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(V<ll> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(V<t2> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(V<t3> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(V<t4> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(V<ll> &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

template <typename T>
void _debug_print(T x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

template <typename TT, typename T>
void _debug_print(const map<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    debug_printf("-- %s %02d:%02d:%02d.%06ld\n",
                 prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

void get_divisors(V<ll> &retlist, ll x)
{
    for (ll i = 1LL; i < sqrt(x) + 3LL; ++i) {
        if (x % i == 0LL) {
            retlist.push_back(i);
            retlist.push_back(x / i);
        }
    }
}

bool judge_freq(const V<ll> &xlist, ll n, ll d)
{
    rep (i, n) if (xlist[i] != xlist[i%d]) return false;
    return true;
}

ll freq(const V<ll> &xlist, const set<ll> &divs, ll n)
{
    for (auto d : divs) if (judge_freq(xlist, n, d)) return d;
    assert(false);
}

#define MOD (1945718823LL)
#define MLT (1759LL)

ll hash_init(const V<ll> &xlist, ll f)
{
    ll ret = 0;
    rep (i, f) {
        ret *= MLT;
        ret %= MOD;
        ret += xlist[i];
        ret %= MOD;
    }
    return ret;
}

bool allcheck(const V<ll> &xlist, const V<ll> &ylist, ll xidx, ll n, ll f)
{
    rep (idx, f) if (xlist[(xidx+idx)%n] != ylist[idx]) return false;
    return true;
}

void _main()
{
    ll n; llin(n);
    V<ll> alist; llina(alist, n);
    V<ll> blist; llina(blist, n);

    V<ll> xlist;
    rep (i, n) xlist.pb(alist[i] ^ alist[(i+1)%n]);
    V<ll> ylist;
    rep (i, n) ylist.pb(blist[i] ^ blist[(i+1)%n]);

    debug_printf("---- xlist\n");
    debug_print(xlist);
    debug_printf("---- ylist\n");
    debug_print(ylist);

    V<ll> divlist;
    get_divisors(divlist, n);
    set<ll> divs; for (auto d : divlist) divs.insert(d);

    ll xf = freq(xlist, divs, n);
    ll yf = freq(ylist, divs, n);
    if (xf != yf) {
        debug_printf("------- no 1\n");
        return;
    }

    ll mltf = 1LL;
    rep (i, xf) {
        mltf *= MLT;
        mltf %= MOD;
    }

    debug_printf("---- mltf=%lld\n", mltf);

    ll hash = hash_init(xlist, xf);

    set<t2> xhashset;
    rep (i, xf) {
        xhashset.insert(t2(hash, i));
        hash *= MLT;
        hash %= MOD;
        ll decr = xlist[i] * mltf;
        decr %= MOD;
        hash -= decr;
        if (hash < 0) hash += MOD;
        hash += xlist[(i+xf)%n];
        hash %= MOD;
    }

    debug_printf("-------- xhashset\n");
    debug_print(xhashset);

    ll yhash = hash_init(ylist, xf);
    debug_printf("-------- yhash=%lld\n", yhash);

    ll xidx;

    for (auto iter = xhashset.lower_bound(t2(yhash, -1)); ; iter++) {
        if (iter == xhashset.end()) {
            debug_printf("------- no 2\n");
            return;
        }
        ll xhash = get<0>(*iter);
        xidx = get<1>(*iter);
        if (xhash != yhash) {
            debug_printf("------- no 3\n");
            return;
        }
        if (allcheck(xlist, ylist, xidx, n, xf)) break;
    }

    V<ll> ansidxs;
    while (xidx < n) {
        ansidxs.pb(xidx);
        xidx += xf;
    }

    for (auto ansidx : ansidxs) {
        cout << ansidx << " " << (alist[ansidx] ^ blist[0]) << endl;
    }
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 21068