write a go solution for Description:
Bakry got bored of solving problems related to xor, so he asked you to solve this problem for him.

You are given an array a of n integers [a_1,a_2,ldots,a_n].

Let's call a subarray a_l,a_l+1,a_l+2,ldots,a_r good if a_l,&,a_l+1,&,a_l+2,ldots,&,a_r>a_loplusa_l+1oplusa_l+2ldotsoplusa_r, where oplus denotes the bitwise XOR operation and & denotes the bitwise AND operation.

Find the length of the longest good subarray of a, or determine that no such subarray exists.

Input Format:
The first line contains a single integer n (1<=n<=10^6) — the length of the array.

The second line contains n integers a_1,a_2,ldots,a_n (1<=a_i<=10^6) — elements of the array.

Output Format:
Print a single integer — the length of the longest good subarray. If there are no good subarrays, print 0.

Note:
In the first case, the answer is 2, as the whole array is good: 5&6=4>5oplus6=3.

In the third case, the answer is 4, and one of the longest good subarrays is [a_2,a_3,a_4,a_5]: 1&3&3&1=1>1oplus3oplus3oplus1=0.. Output only the code with no comments, explanation, or additional text.