CF975A.Aramic script

In Aramic language words can only represent objects.

Words in Aramic have special properties:

• A word is a root if it does not contain the same letter more than once.
• A root and all its permutations represent the same object.
• The root $x$ of a word $y$ is the word that contains all letters that appear in $y$ in a way that each letter appears once. For example, the root of "aaaa", "aa", "aaa" is "a", the root of "aabb", "bab", "baabb", "ab" is "ab".
• Any word in Aramic represents the same object as its root.

You have an ancient script in Aramic. What is the number of different objects mentioned in the script?

在阿拉米克语中，单词仅能表示物体。

阿拉米克语的单词具有如下特殊性质：

• 若一个单词不包含重复字母，则称其为词根。
• 一个词根及其所有排列均表示同一物体。
• 单词 $y$ 的词根 $x$ 是由 $y$ 中所有出现过的字母各取一次所组成的单词（即去重后按某种顺序排列）。例如，“aaaa”、“aa”、“aaa”的词根均为“a”，而“aabb”、“bab”、“baabb”、“ab”的词根均为“ab”。
• 阿拉米克语中的任意单词均与其词根表示同一物体。

你拥有一份古老的阿拉米克语文稿。请问该文稿中提到了多少种不同的物体？

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.

第一行包含一个整数 $n$（$1 \leq n \leq 10^3$）—— 表示脚本中单词的数量。

第二行包含 $n$ 个单词 $s_1, s_2, \ldots, s_n$ —— 即脚本本身。每个字符串的长度不超过 $10^3$。

保证所有字符串中的字符均为小写拉丁字母。

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

在第一个测试中，提到了两个对象，代表它们的根为 “a” 和 “ab”。

在第二个测试中，只有一个对象，其根为 “amer”，其余字符串只是 “amer” 的排列。