Largest Y

You are given an array $A$ consisting of $N$ non-negative integers. It is guaranteed that $A$ contains **at least two distinct** elements. You are also given a non-negative integer $X$. For each $Y$ $(0 \leq Y \leq X)$, we create an array $B$ of size $N$ such that $B_i = A_i | Y$, where $|$ denotes the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) operation. Find the **l