Problem Statement

Oh, Senpai, chalo!
Huh, you're installing something right now?
This one's a social game that launches tomorrow!
So are you going to play some social game too, Senpai...?

Senpai, so you do yukicoder!
Meguru does yukicoder too, and she's ranked pretty high!
Besides that, Meguru is a top-ranked player in this game and that game too.
You say you've never seen anyone ranked in so many different games?
That's because Meguru changes her name for each game, and she's decided never to use the same name twice.

Meguru has decided that the names she uses must be anagrams of $\verb|inabameguru|$ that can be read as romaji.
Being readable as romaji means that no consonants are consecutive and that the name ends with a vowel.
Huh, the vowels are the $5$ letters $\verb|a|, \verb|i|, \verb|u|, \verb|e|, \verb|o|$..., even elementary school kids know that, you know?
How have you managed to live until now, Senpai...?
So far, in $N$ games, she has used the names $S_1,S_2,\ldots,S_N$ respectively, but she's wondering what name to use next...
Perfect timing, Senpai! Please choose one for her!!

Input

$N$
$S_1$
$S_2$
$\vdots$
$S_N$

$N$ is an integer greater than or equal to $0$.
$S_1,S_2,\ldots,S_N$ are the names Meguru has used so far in the $N$ games!

Output

Please output exactly $1$ name that Meguru can use in the next game!
Oh, and if none exists, please output $\verb|NO|$.
What will Meguru do in that case... She'll think about it by tomorrow!
This is a special judge problem, and don't forget the newline at the end!

Sample

1
inabameguru

meguruinaba

3
inabameguru
meguruinaba
nemuriugaba

meguriunaba

0

inabameguru