B'Sho has an array a consisting of n integers. An operation consists of choosing two distinct indices i and j and removing a_i and a_j from the array. For example, for the array [2, 3, 4, 2, 5] , Sho can choose to remove indices 1 and 3 . After this operation, the array becomes [3, 2, 5] . Note that after any operation, the length of the array is reduced by two. After he made some operations, Sho has an array that has only distinct elements. In addition, he made operations such that the resulting array is the longest possible. More formally, the array after Sho has made his operations respects these criteria: Output the length of the final array. The first line contains a single integer t ( 1 <= q t <= q 10^3 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= q n <= q 50 ) -- the length of the array. The second line of each test case contains n integers a_i ( 1 <= q a_i <= q 10^4 ) -- the elements of the array. For each test case, output a single integer -- the length of the final array. Remember that in the final array, all elements are different, and its length is maximum. For the first test case Sho can perform operations as follows: For the second test case Sho can perform operations as follows: '...