A pangram (Greek: pan gramma, each letter) is a sentence in which every letter of the alphabet is used at least once. Pangrams are often used to display typefaces, test equipment and develop skills in handwriting, calligraphy, and keyboarding.

Input

The first line of input contains an integer $$t \in \mathbb{N}$$ indicating the number of test cases. Following are $$t$$ lines, each containing a sentence.

Output

Each test case requires a new line of text. If the given sentence is a pangram, then the text "The sentence is a pangram." should be printed. Otherwise the text "The sentence counts n different letters." should be printed, in which case n is the number of different letters in the sentence. No distinction should be made between uppercase and lowercase letters when determining whether a sentence is a pangram and counting the number of letters.

Example

Input:

5
The five boxing wizards jump quickly.
I'm having spam, spam, chips and spam.
Always look on the bright side of life.
We are no longer the knights who say ni!
A horse, a horse, my kingdom for a horse.

Output:

The sentence is a pangram.
The sentence counts 11 different letters.
The sentence counts 17 different letters.
The sentence counts 14 different letters.
The sentence counts 14 different letters.