← 返回题目

题库练习 Aramic script

← 上一题下一题 →

A11695 | $Aramic script$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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.

输出格式

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".

输入输出样例

输入 #1

5
a aa aaa ab abb

输出 #1

输入 #2

3
amer arem mrea

输出 #2

C++ 编辑器

输入

输出