#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

vector<int> makeTable(vector<int> s) {
  int n = s.size();
  vector<int> ret(n+1);
  ret[0] = -1;
  int j = -1;
  rep(i,0,n) {
    while(j >= 0 && s[i] != s[j]) j = ret[j];
    ret[i+1] = ++j;
  }
  return ret;
}

vector<int> kmp(vector<int> s, vector<int> w) {
  vector<int> table = makeTable(w), ret;
  int m = 0, i = 0, n = s.size();
  while(m+i < n) {
    if (w[i] == s[m+i]) {
      if (++i == (int)(w.size())) {
        ret.push_back(m);
        m = m+i-table[i];
        i = table[i];
      }
    } else {
      m = m+i-table[i];
      if (i > 0) i = table[i];
    }
  }
  return ret;
}

int main() {
  int n;
  cin >> n;
  vector<int> A(n), B(n);
  rep(i,0,n) cin >> A[i];
  rep(i,0,n) cin >> B[i];
  vector<int> a(2*n-1), b(n);
  rep(i,0,n) {
    a[i] = A[i] ^ A[(i+1)%n];
    if (i < n-1) {
      a[i+n] = a[i];
    }
    b[i] = B[i] ^ B[(i+1)%n];
  }
  vector<int> ans = kmp(a,b);
  rep(i,0,(int)ans.size()) {
    int x = B[0] ^ A[ans[i]];
    cout << ans[i] << " " << x << endl;
  }
  return 0;
}

### Prompt

Please create a solution in Cpp to the following problem:

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>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

vector<int> makeTable(vector<int> s) {
  int n = s.size();
  vector<int> ret(n+1);
  ret[0] = -1;
  int j = -1;
  rep(i,0,n) {
    while(j >= 0 && s[i] != s[j]) j = ret[j];
    ret[i+1] = ++j;
  }
  return ret;
}

vector<int> kmp(vector<int> s, vector<int> w) {
  vector<int> table = makeTable(w), ret;
  int m = 0, i = 0, n = s.size();
  while(m+i < n) {
    if (w[i] == s[m+i]) {
      if (++i == (int)(w.size())) {
        ret.push_back(m);
        m = m+i-table[i];
        i = table[i];
      }
    } else {
      m = m+i-table[i];
      if (i > 0) i = table[i];
    }
  }
  return ret;
}

int main() {
  int n;
  cin >> n;
  vector<int> A(n), B(n);
  rep(i,0,n) cin >> A[i];
  rep(i,0,n) cin >> B[i];
  vector<int> a(2*n-1), b(n);
  rep(i,0,n) {
    a[i] = A[i] ^ A[(i+1)%n];
    if (i < n-1) {
      a[i+n] = a[i];
    }
    b[i] = B[i] ^ B[(i+1)%n];
  }
  vector<int> ans = kmp(a,b);
  rep(i,0,(int)ans.size()) {
    int x = B[0] ^ A[ans[i]];
    cout << ans[i] << " " << x << endl;
  }
  return 0;
}

```