Given an array of integers. Find the subarray with maximum XOR.
The first line contains the size of array n (n≤105). Second line contains n integers a1,a2,...,an (0≤ai≤1018).
Print such l and r for which the value al xor al+1 xor ... xor ar is maximum among all possible subarrays [l...r] (1≤l≤r≤n). Then in the same line print the value of maximum XOR.