Time Limit: 0.5 seconds Memory Limit: 256 megabytes ---------- Karim is a 5-year-old child who pays great attention to variable names. Karim has a grandfather who hates "alliteration" (repetition of sounds/letters). He likes names in which the number of distinct letters is high. For example, `karim` has five distinct letters (all its letters are distinct) and `abbas` has three distinct letters (the letters `a`, `b`, and `s`). Karim is having trouble choosing a name for a variable in his code and is hesitant between $n$ available names. He gives these names to his grandfather to choose the best one. We know that the grandfather chooses the name that has the largest number of distinct letters. Given these names, determine the number of distinct letters in the name chosen by the grandfather. # Input The first line of input contains the number $n$. In the next $n$ lines, each line contains a suggested name. Each name is a string of at most 20 lowercase English letters. # Output Print a single number on the output line, which is equal to the number of distinct letters in the chosen name. # Example ## Sample Input 1 ``` 4 ali karim abbas mohammad ``` ## Sample Output 1 ``` 5 ```