Problem A
Font
Little Ivica got himself a summer job at a company that produces computer fonts. The branch of the company where Ivica works at specialises in testing computer fonts and Ivica’s team is responsible of testing only lowercase letters of the English alphabet.
The letters are tested so that various sentences using those letters are printed out and then manually (more accurately, visually) checked if everything is arranged properly. Only sentences which contain all 26 lowercase letter of the English alphabet (a–z) are used for testing purposes. These sentences are called test sentences.
You’ve probably already assumed that Ivica’s job is to find test sentences. He has a dictionary which consists of $N$ words and has to calculate how many different test sentences can be made out of those words. Every word from the dictionary can be used only once in the sentence and the order of the words in the sentence is irrelevant (i.e. “uvijek jedem sarmu” and “jedem sarmu uvijek” are equal sentences).
Input
The first line of input contains the integer $N$ $(1 \leq N \leq 25)$, the number of words in the dictionary. Each of the following $N$ lines contains a single word from the dictionary, its length not exceeding 100. All the words from the dictionary are going to be unique.
Output
The first and only line of output must contain the required number from the task.
| Sample Input 1 | Sample Output 1 |
|---|---|
9 the quick brown fox jumps over a sleazy dog |
2 |
| Sample Input 2 | Sample Output 2 |
|---|---|
3 a b c |
0 |
| Sample Input 3 | Sample Output 3 |
|---|---|
15 abcdefghijkl bcdefghijklm cdefghijklmn defghijklmno efghijklmnop fghijklmnopq ghijklmnopqr hijklmnopqrs ijklmnopqrst jklmnopqrstu klmnopqrstuv lmnopqrstuvw mnopqrstuvwx nopqrstuvwxy opqrstuvwxyz |
8189 |