The Constitution of a certain country states that the leader is the person with the name containing the greatest number of different alphabet letters. (The country uses the uppercase English alphabet from A through Z.) For example, the name GOOGLE has four different alphabet letters: E, G, L, and O. The name APAC CODE JAM has eight different letters. If the country only consists of these persons, APAC CODE JAM would be the leader.
If there is a tie, the person whose name comes earliest in alphabetical order is the leader.
Given a list of names of the citizens of the country, can you determine who the leader is?
输入格式
The first line of the input gives the number of test cases, . test cases follow. Each test case starts with a line with an interger , the number of people in the country. Then lines follow. The -th line represents the name of the -th person. Each name contains at most characters and contains at least one alphabet letter.
输出格式
For each test case, output one line containing Case #x: y, where is the test case number (starting from ) and is the name of the leader.
样例
样例输入 1
2
3
ADAM
BOB
JOHNSON
2
A AB C
DEF
样例输出 1
Case #1: JOHNSON
Case #2: A AB C
数据范围与提示
In sample case #, JOHNSON contains different alphabet letters ('H', 'J', 'N', 'O', 'S'), so he is the leader.
Sample case # would only appear in Large data set. The name DEF contains different alphabet letters, the name A AB C also contains different alphabet letters. A AB C comes alphabetically earlier so he is the leader.
Limits
.
.
Small dataset (Test set 1 - Visible)
Each name consists of at most characters and only consists of the uppercase English letters A through Z.
Large dataset (Test set 2 - Hidden)
Each name consists of at most characters and only consists of the uppercase English letters A through Z and ' '(space).
