All Distinct

题意翻译

有多组数据。 给你若干个数，每次删除 $2$ 个数，求删除若干次后使数中没有重复的前提下剩下最多的数。

题目描述

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: - No pairs such that ( $ i < j $ ) and $ a_i = a_j $ exist. - The length of $ a $ is maximized. Output the length of the final array.

输入输出格式

输入格式

The first line contains a single integer $ t $ ( $ 1 \leq t \leq 10^3 $ ) — the number of test cases. The first line of each test case contains a single integer $ n $ ( $ 1 \leq n \leq 50 $ ) — the length of the array. The second line of each test case contains $ n $ integers $ a_i $ ( $ 1 \leq a_i \leq 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.

输入输出样例

输入样例 #1

4
6
2 2 2 3 3 3
5
9 1 9 9 1
4
15 16 16 15
4
10 100 1000 10000

输出样例 #1

2
1
2
4

说明

For the first test case Sho can perform operations as follows: 1. Choose indices $ 1 $ and $ 5 $ to remove. The array becomes $ [2, 2, 2, 3, 3, 3] \rightarrow [2, 2, 3, 3] $ . 2. Choose indices $ 1 $ and $ 4 $ to remove. The array becomes $ [2, 2, 3, 3] \rightarrow [2, 3] $ . The final array has a length of $ 2 $ , so the answer is $ 2 $ . It can be proven that Sho cannot obtain an array with a longer length.For the second test case Sho can perform operations as follows: 1. Choose indices $ 3 $ and $ 4 $ to remove. The array becomes $ [9, 1, 9, 9, 1] \rightarrow [9, 1, 1] $ . 2. Choose indices $ 1 $ and $ 3 $ to remove. The array becomes $ [9, 1, 1] \rightarrow [1] $ . The final array has a length of $ 1 $ , so the answer is $ 1 $ . It can be proven that Sho cannot obtain an array with a longer length.

题目大意：
Sho有一个由n个整数组成的数组a。每次操作包括选择两个不同的索引i和j，并从数组中删除a_i和a_j。经过若干次操作后，使得数组中没有重复元素的前提下，剩下的数组长度最大。输出最终数组的长度。

输入输出数据格式：
输入格式：
- 第一行包含一个整数t（1≤t≤10^3）——测试用例的数量。
- 每个测试用例的第一行包含一个整数n（1≤n≤50）——数组的长度。
- 每个测试用例的第二行包含n个整数a_i（1≤a_i≤10^4）——数组的元素。

输出格式：
- 对于每个测试用例，输出一个整数——最终数组的长度。注意，在最终数组中，所有元素都是不同的，并且其长度是最大的。题目大意： Sho有一个由n个整数组成的数组a。每次操作包括选择两个不同的索引i和j，并从数组中删除a_i和a_j。经过若干次操作后，使得数组中没有重复元素的前提下，剩下的数组长度最大。输出最终数组的长度。 输入输出数据格式： 输入格式： - 第一行包含一个整数t（1≤t≤10^3）——测试用例的数量。 - 每个测试用例的第一行包含一个整数n（1≤n≤50）——数组的长度。 - 每个测试用例的第二行包含n个整数a_i（1≤a_i≤10^4）——数组的元素。 输出格式： - 对于每个测试用例，输出一个整数——最终数组的长度。注意，在最终数组中，所有元素都是不同的，并且其长度是最大的。