Anagram

Two words are anagrams if the letters of the first word can be reordered to obtain the second one. An instance of anagrams is the pair "listen" and "silent".

You are given a list of words, each word consisting of lowercase letters. Your goal is to filter this list by dropping any word whose anagram has already appeared earlier on the list.

The first line contains $n$, the length of the list. This is followed by $n$ lines, each containing one word.

Print out the list of words without anagrams, one word per line. The words should appear in the same order as given in the input.

• $1 \le n \le 10^5$
• All letters are lowercase letters of the English alphabet.
• Length of any word will not exceed $100$.