Input a set of words consisting only of lowercase letters. Your task is to count how many words are "cool," meaning that the frequency of each character appearing in the word is unique.

For example, ada is cool because a appears 2 times and d appears 1 time, and 1 and 2 are different. Similarly, banana is also cool because a appears 3 times, n appears 2 times, and b appears 1 time. However, bbacccd is not cool because a and d appear the same number of times (both 1 time).

Input

The input contains no more than 30 test cases. The first line of each test case contains the number of words $n$ ($1 \le n \le 10000$). The following $n$ lines each contain a word with a length of 1 to 30 characters.

Output

For each test case, output the test case number and the number of cool words.

Examples

Input 1

2
ada
bbacccd
2
illness
a

Output 1

Case 1: 1
Case 2: 0