Remove Bad elements

Chef has an array $A$ of length $N$. In one operation, Chef can remove **any one** element from the array. Determine the **minimum** number of operations required to make all the elements **same**. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of multiple lines of input. - The first line of each test case