XOR Shortest Path

You are given an array $A$ of $N$ elements, and based on that, you have constructed a **complete weighted undirected graph** with the weights of its edges having a special property. The edge connecting nodes $X$ and $Y$ has a weight of $A_X \oplus A_Y$, where $\oplus$ represents the Bitwise XOR operator. You want to find the shortest length of a **simple path** from vertex $1$ to vertex $N$. H