#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
typedef long long ll;

int main() {
    int N; cin >> N;
    vector<int> A(N), B(N);
    for(int i = 0; i < N; ++i) cin >> A[i];
    for(int i = 0; i < N; ++i) cin >> B[i];
    vector<int> C(N), D(N);
    for(int i = 0; i < N; ++i) C[i] = A[i] ^ A[(i + 1) % N];
    for(int i = 0; i < N; ++i) D[i] = B[i] ^ B[(i + 1) % N];
    // find D in C * 2
    for(int i = 0; i < N; ++i) {
        C.push_back(C[i]);
    }
    // KMP algorithm
    vector<int> fail(N, 0);
    for(int i = 1, j = 0; i < N; ++i) {
        while(j > 0 && D[i] != D[j]) j = fail[j - 1];
        if(D[i] == D[j]) fail[i] = ++j;
    }
    vector<int> ret;
    for(int i = 0, j = 0; i < 2 * N; ++i) {
        while(j > 0 && C[i] != D[j]) j = fail[j - 1];
        if(C[i] == D[j]) {
            if(j == N - 1) {
                ret.push_back(i - N + 1);
                j = fail[j];
            } else ++j;
        }
    }
    for(auto &k : ret) {
        if(k >= N) continue;
        int x = A[k] ^ B[0];
        cout << k << " " << x << "\n";
    }    
}

### Prompt

Please provide a CPP coded solution to the problem described below:

Given are two sequences a=\\{a_0,\ldots,a_{N-1}\\} and b=\\{b_0,\ldots,b_{N-1}\\} of N non-negative integers each.

Snuke will choose an integer k such that 0 \leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\ldots,a_{N-1}'\\}, as follows:

* a_i'= a_{i+k \mod N}\ XOR \ x



Find all pairs (k,x) such that a' will be equal to b.

What is \mbox{ XOR }?

The XOR of integers A and B, A \mbox{ XOR } B, is defined as follows:

* When A \mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.

For example, 3 \mbox{ XOR } 5 = 6. (In base two: 011 \mbox{ XOR } 101 = 110.)

Constraints

* 1 \leq N \leq 2 \times 10^5
* 0 \leq a_i,b_i < 2^{30}
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
a_0 a_1 ... a_{N-1}
b_0 b_1 ... b_{N-1}


Output

Print all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).

If there are no such pairs, the output should be empty.

Examples

Input

3
0 2 1
1 2 3


Output

1 3


Input

5
0 0 0 0 0
2 2 2 2 2


Output

0 2
1 2
2 2
3 2
4 2


Input

6
0 1 3 7 6 4
1 5 4 6 2 3


Output

2 2
5 5


Input

2
1 2
0 0


Output

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
typedef long long ll;

int main() {
    int N; cin >> N;
    vector<int> A(N), B(N);
    for(int i = 0; i < N; ++i) cin >> A[i];
    for(int i = 0; i < N; ++i) cin >> B[i];
    vector<int> C(N), D(N);
    for(int i = 0; i < N; ++i) C[i] = A[i] ^ A[(i + 1) % N];
    for(int i = 0; i < N; ++i) D[i] = B[i] ^ B[(i + 1) % N];
    // find D in C * 2
    for(int i = 0; i < N; ++i) {
        C.push_back(C[i]);
    }
    // KMP algorithm
    vector<int> fail(N, 0);
    for(int i = 1, j = 0; i < N; ++i) {
        while(j > 0 && D[i] != D[j]) j = fail[j - 1];
        if(D[i] == D[j]) fail[i] = ++j;
    }
    vector<int> ret;
    for(int i = 0, j = 0; i < 2 * N; ++i) {
        while(j > 0 && C[i] != D[j]) j = fail[j - 1];
        if(C[i] == D[j]) {
            if(j == N - 1) {
                ret.push_back(i - N + 1);
                j = fail[j];
            } else ++j;
        }
    }
    for(auto &k : ret) {
        if(k >= N) continue;
        int x = A[k] ^ B[0];
        cout << k << " " << x << "\n";
    }    
}

```