Minimum Transport Trips

You are given several test cases. In each test case, there is a group of guests arriving at different times. When multiple guests arrive at the same time, they can be transported together in a single trip.

Your task is to determine the minimum number of trips required to transport all the guests. In other words, you need to count how many distinct arrival times there are because guests arriving at the same time can be taken in one trip.

Note: All input is taken from standard input (stdin) and all output must be printed to standard output (stdout).

inputFormat

The input is read from standard input (stdin) and follows the format below:

T
N1
arrival_time_1 arrival_time_2 ... arrival_time_N1
N2
arrival_time_1 arrival_time_2 ... arrival_time_N2
...

The first line contains an integer T, the number of test cases. For each test case, the first line after that contains an integer N, the number of guests, and the next line contains N space-separated integers representing the arrival times of the guests.

outputFormat

For each test case, output a single integer on a new line denoting the minimum number of trips required to transport all the guests.

## sample

2
5
1 3 3 9 10
4
0 0 0 0

4
1

</p>