问题描述：
As the increase of population, the living space for people is becoming smaller and smaller. In MagicStar the problem is much worse. Dr. Mathematica is trying to save land by clustering buildings and then we call the set of buildings MagicBuilding. Now we can treat the buildings as a square of size d, and the height doesn't matter. Buildings of d1,d2,d3....dn can be clustered into one MagicBuilding if they satisfy di != dj(i != j).
Given a series of buildings size , you need to calculate the minimal numbers of MagicBuildings that can be made. Note that one building can also be considered as a MagicBuilding.
Suppose there are five buildings : 1, 2, 2, 3, 3. We make three MagicBuildings (1,3), (2,3), (2) .And we can also make two MagicBuilding :(1,2,3), (2,3). There is at least two MagicBuildings obviously.
输入：
The first line of the input is a single number t, indicating the number of test cases.
Each test case starts by n (1≤n≤10^4) in a line indicating the number of buildings. Next n positive numbers (less than 2^31) will be the size of the buildings.
输出：
For each test case , output a number perline, meaning the minimal number of the MagicBuilding that can be made.
输入：
2
1
2
5
1 2 2 3 3
输出：
1
2

我也看不明白!!!

你应该先翻译下再来求助

那个MagicBuildings是魔法屋的意思吗

由于人口的增加，人们对生活空间变得越来越小。在MagicStar问题更糟。数学博士正试图通过聚类建筑节约土地，然后我们所说的一套建筑MagicBuilding的。现在我们可以把建筑物作为尺寸d的正方形，高度无关紧要。d1的建筑物，D2，D3.... DN可以，如果它们满足di！= dj（ⅰ！= j）条聚为一MagicBuilding。
鉴于一系列的建筑规模，你需要计算可以作出神奇建筑的最小的数字。注意，一个建筑物也可以被认为是一个MagicBuilding。
假设有五幢建筑：1，2，2，3，3，我们提出三点魔术建筑物（1,3），（2,3），（2）。而我们也可以提出两个MagicBuilding：（1,2， 3），（2,3）。有至少两个MagicBuildings明显。

输入的第一行是一个单一的号t，指示测试用例的数目。
每个测试情况下，由在指示建筑物的数目的n行（1≤n≤10^ 4）开始。下n的正数（小于2 ^ 31）将作为建筑物的大小。