Bitwise <code>OR</code> can never unset a bit. If there is a solution, there must be a solution with only a pair of elements.

We can brute force the solution: enumerate all the pairs.

As the least significant bit must stay unset, the question is whether the array has at least two even elements.