output_description: 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.
  
  * * *
input_description: 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}
attempt: N = int(input())
  A = list(map(int, input().split()))
  B = list(map(int, input().split()))
  
  A.append(A[0])
  B.append(B[0])
  
  AX = []
  BX = []
  for i in range(N):
      AX.append(A[i] ^ A[i + 1])
      BX.append(B[i] ^ B[i + 1])
  
  AX += AX[:-1]
  
  # MP法
  
  
  LEN = len(BX)
  MP = [-1] * (LEN + 1)  # 「接頭辞と接尾辞が最大何文字一致しているか」を記録する配列
  NOW = -1  # 何文字一致しているか.
  
  for i in range(LEN):
      while (
          NOW >= 0 and BX[i] != BX[NOW]
      ):  # 一致していなかったら0から数え直すのではなく, MP[NOW]から数える.
          NOW = MP[NOW]
      NOW += 1
      MP[i + 1] = NOW
  
  LEN2 = len(AX)
  
  MP_SEARCH = [0] * (
      LEN2
  )  # その文字までで何個一致しているかを調べる. LEN文字一致したらSが検出できたということ.
  NOW = 0
  for i in range(LEN2):
      while NOW >= 0 and AX[i] != BX[NOW]:
          NOW = MP[NOW]
      NOW += 1
      MP_SEARCH[i] = NOW
  
      if NOW == LEN:  # LEN文字一致したら, MP[LEN]から数える.
          NOW = MP[NOW]
  
  for i in range(LEN2):
      if MP_SEARCH[i] == LEN:
          print(i - LEN + 1, A[i - LEN + 1] ^ B[0])
  
problem_description: Statement
  
  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.)
samples: [{"input": "3\n    0 2 1\n    1 2 3", "output": "1 3\n    \n\nIf (k,x)=(1,3),\n\n  * a_0'=(a_1\\ XOR \\ 3)=1\n\n  * a_1'=(a_2\\ XOR \\ 3)=2\n\n  * a_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\n* * *"}, {"input": "5\n    0 0 0 0 0\n    2 2 2 2 2", "output": "0 2\n    1 2\n    2 2\n    3 2\n    4 2\n    \n\n* * *"}, {"input": "6\n    0 1 3 7 6 4\n    1 5 4 6 2 3", "output": "2 2\n    5 5\n    \n\n* * *"}, {"input": "2\n    1 2\n    0 0", "output": "No pairs may satisfy the condition."}]