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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


typedef pair<ll,ll> SIGNATURE;

template <typename T>
struct RollingHash {
    T base1, base2;
    ll mod1, mod2;
    vector<ll> hash1, hash2;
    vector<ll> pow1, pow2;

    RollingHash() : base1(500009), base2(500029), mod1(1000000007), mod2(1000000009) {}

    void init(const vector<T> &ar) {
        int n = ar.size();

        hash1.assign(n+1,0);
        hash2.assign(n+1,0);
        pow1.assign(n+1,1);
        pow2.assign(n+1,1);

        for (int i=0; i<n; i++) {
            hash1[i+1] = (hash1[i] + ar[i]) * base1 % mod1;
            hash2[i+1] = (hash2[i] + ar[i]) * base2 % mod2;
            pow1[i+1] = pow1[i] * base1 % mod1;
            pow2[i+1] = pow2[i] * base2 % mod2;
        }
    }

    SIGNATURE get(int l,int r) {
        ll t1 = ((hash1[r] - hash1[l] * pow1[r-l]) % mod1 + mod1) % mod1;
        ll t2 = ((hash2[r] - hash2[l] * pow2[r-l]) % mod2 + mod2) % mod2;
        return SIGNATURE(t1, t2);
    }

    SIGNATURE concat(SIGNATURE h1, SIGNATURE h2, int h2_len) {
        return SIGNATURE(
            (h1.first * pow1[h2_len] + h2.first) % mod1,
            (h1.second * pow2[h2_len] + h2.second) % mod2
        );
    }
};


inline vvi bitsep(int N, vi& a, int bits){
    vvi an(bits, vi(N));
    rep(i,N){
        int x = a[i];
        rep(j,bits){
            an[j][i] = x & 1;
            x >>= 1;
        }
    }
    return an;
}

void solve(int N, vi& a, vi& b) {
    vvi an = bitsep(N, a, 30);
    vvi bn = bitsep(N, b, 30);

    vi possible(N, 0);
    vi mask(N, 0);

    rep(bit,30){
        int m = 1 << bit;
        vi an2 = an[bit];
        an2.insert(an2.end(), ALL(an[bit]));

        RollingHash<int> rha, rhb, rhb_;
        rha.init(an2);

        vi bn1 = bn[bit];
        rhb.init(bn1);
        rep(i,N) bn1[i] = 1-bn1[i];
        rhb_.init(bn1);

        SIGNATURE b0 = rhb.get(0, N);
        SIGNATURE b1 = rhb_.get(0, N);
        rep(rot,N){
            SIGNATURE sg = rha.get(rot, rot+N);
            if (sg == b0) {
                possible[rot]++;
            }
            else if (sg == b1) {
                possible[rot]++;
                mask[rot] |= m;
            }
        }
    }

    rep(k,N){
        if (possible[k] == 30){
            printf("%d %d\n", k, mask[k]);
        }
    }
}

int main() {
    int N; scanf("%d%*c", &N);
    vi a(N), b(N);
    loadvec(a,N);
    loadvec(b,N);
    solve(N,a,b);
    return 0;
}


Measured memory_bytes: 79684