Equal by XORing

JJ has three integers $A$, $B$, and $N$. He can apply the following operation on $A$: - Select an integer $X$ such that $1 \le X \lt N$ and set $A := A \oplus X$. (Here, $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).) JJ wants to make $A$ **equal** to $B$. Determine the **minimum** number of operations required to do so. Print $-1$ if it is n