Taco Walls Painting

You are given a set of walls, each with a certain height. In one operation, you can paint all walls that have a particular height. Your task is to determine the minimum number of operations needed to paint all the walls completely.

In other words, the answer for each test case is the number of distinct wall heights. For example, given the wall heights [4, 3, 5], there are 3 distinct heights so 3 operations are needed.

Note: Even if the walls have a height of zero, they still count as a valid height.

inputFormat

The first line contains an integer T, the number of test cases. For each test case, the first line contains an integer N, the number of walls. The following line contains N space-separated integers representing the heights of the walls.

outputFormat

For each test case, output the minimum number of operations needed to paint all the walls on a separate line.

## sample

1
3
4 3 5

3

</p>