Unique Anagram Finder

Given a set of words, all words except one are anagrams of at least one other word in the set. Two words are anagrams if they contain exactly the same characters with the same frequency; mathematically, for a word \(w\), its sorted sequence of characters is given by \(sorted(w)\).

Your task is to identify and output the unique word that does not have any anagrams in the list.

inputFormat

The first line contains an integer \(n\) (\(n \ge 3\)), representing the number of words. The following \(n\) lines each contain a single word.

outputFormat

Output the unique word that is not an anagram of any other word from the list.

5
listen
silent
enlist
inlets
google

google