“

Excuse me…

I am not a Stalker.

I am a Researcher,

And you just happened

To be a good subject…  

”

This is the Note XOXO has sent as a text to his CRUSH to impress her. In reply, his crush COCO has sent him an array of 2*N numbers and asked XOXO to find out the CRUSH_Factor of that array.

What is a CRUSH_Factor?

If A is an array of length N, then,
CRUSH_Factor = min( A_N-N+i ⊕ A_N-N+i+1 ); ∀ i ∈ [1,N-1]

Formally, CRUSH_Factor is the minimum bitwise XOR between all the adjacent elements of an array.

Now, as being a programmer, XOXO have the ability of modifying the initial array provided by COCO as a text. XOXO can change the array arrangement by doing one of the following two operations on each move.

If A is an array of 2*N numbers. Then the moves are:

1. Swap A₁ and A₂, A₃ and A₄, …… , A_2*N-1 and A_2*N
2. Swap A₁ and A_N+1, A₂ and A_N+2, …… , A_N and A_2*N

Now, you have to help XOXO find an optimal organization of the array. That is, you have to find the Maximum achievable CRUSH_Factor and the minimum moves to find it. 

Constraints:

1 <= N <= 1000

1 <= A_i <= 10000000

Sample I/O:

Input:

            4

            6  5  8  7  2  1  4  3

Output:

            The Maximum achievable CRUSH Factor is 3 and Min move(s) to find it is 0