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
#define _USE_MATH_DEFINES

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <unordered_map> 
#include <unordered_set>
#include <functional>
#include <bitset>

using namespace std;

typedef pair<long long int, long long int> P;
typedef tuple<int, int, int> T;

long long int INF = 1e18;
long long int MOD = 1e9 + 7;

// A[i] : S と S[i:] の先頭が何文字共通しているか
long long int A[1000000];

// O(|S|)
void Z_algorithm(vector<long long int> S){
	A[0] = S.size();
	int i = 1, j = 0;
	while (i < S.size()) {
		while (i + j < S.size() && S[j] == S[i + j]){
			j += 1;
		}
		A[i] = j;
		if (j == 0) {
			++i;
			continue;
		}
		int k = 1;
		while (i + k < S.size() && k + A[k] < j){
			A[i + k] = A[k];
			k += 1;
		}
		i += k; j -= k;
	}
}

long long int a[210000], b[210000];
vector<long long int> v;

int main(){
	int N;
	cin >> N;
	for(int i = 0; i < N; i++){
		cin >> a[i];
	}
	a[N] = a[0];
	for(int i = 0; i < N; i++){
		cin >> b[i];
	}
	b[N] = b[0];
	for(int i = 0; i < N; i++){
		v.push_back(b[i] ^ b[i + 1]);
	}
	v.push_back(-1);
	for(int i = 0; i < N; i++){
		v.push_back(a[i] ^ a[i + 1]);
	}
	for(int i = 0; i < N; i++){
		v.push_back(a[i] ^ a[i + 1]);
	}
	Z_algorithm(v);
	for(int i = N + 1; i <= 2 * N; i++){
		if(A[i] >= N){
			int pos = i - (N + 1);
			cout << pos << " " << (b[0] ^ a[pos]) << endl;
		}
	}
	return 0;
}