|Codeforces Round #478 (Div. 2)|
In Aramic language words can only represent objects.
Words in Aramic have special properties:
You have an ancient script in Aramic. What is the number of different objects mentioned in the script?
The first line contains one integer $$$n$$$ ($$$1 \leq n \leq 10^3$$$) — the number of words in the script.
The second line contains $$$n$$$ words $$$s_1, s_2, \ldots, s_n$$$ — the script itself. The length of each string does not exceed $$$10^3$$$.
It is guaranteed that all characters of the strings are small latin letters.
Output one integer — the number of different objects mentioned in the given ancient Aramic script.
a aa aaa ab abb
amer arem mrea
In the first test, there are two objects mentioned. The roots that represent them are "a","ab".
In the second test, there is only one object, its root is "amer", the other strings are just permutations of "amer".