Dividing by 2

You have an array $A$ of $N$ integers. In one operation, you can do the following: - Choose any index $i$ ($1 \le i \le N$), and update $A_i = \lfloor \dfrac{A_i}{2} \rfloor$. Find the minimum number of operations needed to make all the array elements equal. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of mul