A desert caravan logs a cargo tag at every checkpoint along its route. Each tag is a lowercase word describing the bundle carried at that stop. The quartermaster patrols the manifest looking for two neighboring checkpoints whose tags use exactly the same letters in some order (an anagram of one another); whenever such a pair is found, the later entry is struck out as a redundant echo of the one right before it. Because striking an entry can bring two tags that were not originally adjacent together, the quartermaster repeats this check — scanning for any adjacent anagram pair and striking the second one — for as long as any such pair remains anywhere in the manifest. Once no two neighboring tags are anagrams of each other, report the manifest that is left.

Input format

• Line 1: a single integer n, the number of checkpoint tags.
• Line 2: n space-separated lowercase words, the tags in checkpoint order.

Output format

Print the final manifest as space-separated tags, in their remaining relative order, on a single line.

Constraints

• 1 <= n <= 100000
• Each tag consists of 1 to 10 lowercase English letters.

5
abba baba bbaa cd cd

abba cd

4
face ecaf cash dog

face cash dog