The Subarray XOR

Given an array $A$ having $N$ elements, a subarray $S$ of $A$ is called `good` if $XOR(S) \geq K$, where $XOR(S)$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all the elements of the subarray $S$. Find the length of the **smallest** subarray $S$ which is `good`. If there is no `good` subarray, print $-1$ instead. ### Input - The first line of input contains a