#include<bits/stdc++.h>
using namespace std;
long long arr[100005]; /// global declaration for large array
int main()
{
int T;
scanf("%d",&T); /// input test
for(int cs=1; cs<=T; cs++){
int n;
scanf("%d",&n); /// input number of elements
for(int i=0; i<n; i++){
scanf("%lld",&arr[i]); /// input all elements
}
sort(arr,arr+n); /// sort all elements
int cnt = 0;
for(int i=0; i<n; i++){
if(i==0) cnt++; /// handle the first element
else if(arr[i]!=arr[i-1]) cnt++; /// count without duplicate
}
printf("Case %d: %d\n",cs,cnt); /// print output
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKbG9uZyBsb25nIGFyclsxMDAwMDVdOyAgLy8vIGdsb2JhbCBkZWNsYXJhdGlvbiBmb3IgbGFyZ2UgYXJyYXkgCmludCBtYWluKCkKewogICAgaW50IFQ7CiAgICBzY2FuZigiJWQiLCZUKTsgLy8vIGlucHV0IHRlc3QgCiAgICBmb3IoaW50IGNzPTE7IGNzPD1UOyBjcysrKXsKICAgICAgICBpbnQgbjsgCgogICAgICAgIHNjYW5mKCIlZCIsJm4pOyAvLy8gaW5wdXQgbnVtYmVyIG9mIGVsZW1lbnRzIAogICAgICAgIAogICAgICAgIGZvcihpbnQgaT0wOyBpPG47IGkrKyl7CiAgICAgICAgICAgIHNjYW5mKCIlbGxkIiwmYXJyW2ldKTsgIC8vLyBpbnB1dCBhbGwgZWxlbWVudHMgCiAgICAgICAgfQoKICAgICAgICBzb3J0KGFycixhcnIrbik7ICAvLy8gc29ydCBhbGwgZWxlbWVudHMgCgogICAgICAgIGludCBjbnQgPSAwOwogICAgICAgIGZvcihpbnQgaT0wOyBpPG47IGkrKyl7CiAgICAgICAgICAgIGlmKGk9PTApIGNudCsrOyAgIC8vLyBoYW5kbGUgdGhlIGZpcnN0IGVsZW1lbnQgCiAgICAgICAgICAgIGVsc2UgaWYoYXJyW2ldIT1hcnJbaS0xXSkgY250Kys7ICAvLy8gY291bnQgd2l0aG91dCBkdXBsaWNhdGUgCiAgICAgICAgfSAKCiAgICAgICAgcHJpbnRmKCJDYXNlICVkOiAlZFxuIixjcyxjbnQpOyAvLy8gcHJpbnQgb3V0cHV0IAoKCiAgICB9CgogICAgcmV0dXJuIDA7Cn0K