Subarray with maximum XOR

Input

The first line contains the size of array $n (n \leq 1 0^{5})$ n~(n \le 10^5). Second line contains $n$ integers $a_{1}, a_{2}, ..., a_{n} (0 \leq a_{i} \leq 1 0^{18})$ a_1, a_2, ..., a_n~(0 \le a_i \le 10^{18}).

Output

Print such $l$ and $r$ for which the value $a_{l} x or a_{l + 1} x or ... x or a_{r}$ a_l ~ xor ~ a_{l+1} ~ xor ~ ... ~ xor ~ a_r is maximum among all possible subarrays $[l ... r] (1 \leq l \leq r \leq n)$ [l...r]~(1 \le l \le r \le n). Then in the same line print the value of maximum XOR.

Examples

Example 1

Loading