Lweb and String

Problem Description

Lweb has a string S.

Oneday, he decided to transform this string to a new sequence. 

You need help him determine this transformation to get a sequence which has the longest LIS(Strictly Increasing). 

You need transform every letter in this string to a new number.

A is the set of letters of S, B is the set of natural numbers. 

Every injection f:A→B can be treat as an legal transformation. 

For example, a String “aabc”, A={a,b,c}, and you can transform it to “1 1 2 3”, and the LIS of the new sequence is 3. 

Now help Lweb, find the longest LIS which you can obtain from S.

LIS: Longest Increasing Subsequence. (https://en.wikipedia.org/wiki/Longest_increasing_subsequence)

 

Input

The first line of the input contains the only integer T,(1≤T≤20).

Then T lines follow, the i-th line contains a string S only containing the lowercase letters, the length of S will not exceed 105.

 

Output

For each test case, output a single line "Case #x: y", where x is the case number, starting from 1. And y is the answer.

 

Sample Input

2aabccacdeaa

 

Sample Output

Case #1: 3Case #2: 4

 

这题是我另一个队友写得，这题的关键在于读懂题意，读懂了你会发现，其实就是问你一串字符中有多少个字母出现，然后就没了......

本人比较懒，代码就不写了。