OR Operations

You are given an array $A$ of $N$ integers. In one operation, you can do the following: - choose an index $i$ ($1 \le i < N$) - delete both $A_i$ and $A_{i + 1}$ and insert back $(A_i | A_{i + 1})$ into the same place. Here, $|$ denotes the Bitwise OR Operator. Find the minimum number of operations needed to make all remaining array elements equal. ### Input - The first line of input will co