Full - MarisaOJ: Marisa Online Judge

Full

Time limit: 1000 ms
Memory limit: 256 MB
For $n$ strings composed of lowercase letters, determine how many ways there are to select a set of strings from the given $n$ strings such that all 26 letters appear in the selected strings. Two selection methods are considered different if a string is chosen in one method but not in the other. ### Input - The first line contains an integer $n$. - The next $n$ lines each contain a string. ### Output - Print the number of ways to make the selection. ### Constraints - $1 \le n \le 25$. - The length of each string does not exceed $50$. ### Example Input: ``` 8 the quick brown fox jumps over lazy dog ``` Output: ``` 1 ```