B'You are given an array a of length n consisting of integers. You can apply the following operation, consisting of several steps, on the array a zero or more times: For example, if n=6 and a=[1, 6, 1, 1, 4, 4] , then you can perform the following sequence of operations: What can be the minimum size of the array after applying some sequence of operations to it? The first line contains a single integer t ( 1 <= t <= 10^4 ). Then t test cases follow. The first line of each test case contains a single integer n ( 1 <= n <= 2 cdot 10^5 ) is length of the array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^9 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output the minimum possible size of the array after applying some sequence of operations to it. '...