Array Removal

You are given an array $A$ of size $N$. Your task is to determine the **minimum** number of elements that need to be removed from the array $A$ such that the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of the remaining elements is $2^x - 1$ for some integer $x \ (x\geq 0)$. Note that the bitwise OR of an empty array is considered to be $0$. ### Input - The first line of inp