B"Let's call an array a beautiful if you can make all its elements the same by using the following operation an arbitrary number of times (possibly, zero): You are given a beautiful array a_1, a_2, ... , a_n . What is the minimum number of elements you have to remove from it in order for it to stop being beautiful? Swapping elements is prohibited. If it is impossible to do so, then output -1. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= n <= 3 cdot 10^5 ). The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= n ). Additional constraints on the input: For each test case, output a single integer -- the minimum number of elements you have to remove from the array a in order for it to stop being beautiful. If it is impossible, then output -1. In the first testcase, it is impossible to modify the array in such a way that it stops being beautiful. An array consisting of identical numbers will remain beautiful no matter how many numbers we remove from it. In the second testcase, you can remove the number at the index 5 , for example. The resulting array will be [1, 2, 1, 2] . Let's check if it is beautiful. Two operations are available: Thus, the array [1, 2, 1, 2] is not beautiful. In the fourth testcase, you can remove the first three elements, for example. The resulting array [5, 3, 3, 3] is not beautiful. "...