Vasya is a regular visitor of the Trade Fair 2018 at Bangabandhu International Conference Center (BICC) in Sher-E-Bangla Nagar, Dhaka. Today he also visits the Trade Fair. Today he wants to count all the people in the fair but there is a problem. He cannot remember every person in the fair because it is a normal behavior of human brain that it cannot remember each and every thing. But Vasya is determined to do the task.
You are a great programmer of University of Asia Pacific (UAP) and Vasya knows that. So he comes to you to seek your help by making an efficient computer program for him.
Vasya gives you N integer values and you have to calculate the maximum number of distinct people he counts at once.
For example if he gives you 5 integer values which are 1 3 2 1 2.Then the answer will be 3 because 1 3 2 are three distinct people, 2 1 2 are not.
Input
Input starts with an integer T (1<=T<=12), denoting the number of test cases. Each test case begins with a single integer N(1<=N<=100000).Then there will be N integers separated with space which is between 1 and 10^7.
Output
For each case of input, print Case x: ans in a single line. Here x is the test case number and ans is the desired answer. See Sample Input/output and Explanation part for more clarifications.
Sample
| Input | Output |
|---|---|
2 6 1 2 3 4 1 2 6 1 2 1 2 3 1 | Case 1: 4 Case 2: 3 |
In the first sample, 3 4 1 2 are contains the maximum number of distinct people of 4
In the second sample, 2 3 1 are distinct.
