You are given an array A of length N. In one move, select an integer X and do one of the following operations:
Find the minimum number of moves required to make the array empty.
Input format:
Output format:
For each test case, print the minimum moves needed to make the array empty.
Constraints:
1<=T<=10
1<=N<=105
1<=A[i]<=106
For test case 1:
Hence, the minimum number of moves needed is 2.
For test case 2:
Hence, the minimum number of moves needed is 1.