Given an array of integers. Find the subarray with maximum \textbf{XOR}. \InputFile The first line contains the size of array $n~(n \le 10^5)$. Second line contains $n$ integers $a_1, a_2, ..., a_n~(0 \le a_i \le 10^{18})$. \OutputFile Print such $l$ and $r$ for which the value $a_l ~ xor ~ a_{l+1} ~ xor ~ ... ~ xor ~ a_r$ is maximum among all possible subarrays $[l...r]~(1 \le l \le r \le n)$. Then in the same line print the value of maximum \textbf{XOR}.