Xor Array

You are given an array $A$ consisting of $N$ **distinct** positive integers. In one operation, you can: - Choose a non-negative integer $X$; - For all $(1\le i\le N)$, set $A_i := A_i \oplus X$, where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Exclusive_or). Find the **maximum** possible length of the **longest strictly increasing subarray** after performing the