Find the first word in a sequence that has the same quantity of vowels than a previous word.
Input
Input is a sequence of words; each word is a nonempty string consisting only of lowercase letters that comes alone in a line. However, there might be empty lines interspersed with them. The end of the sequence is marked by the word XXX, that should not be considered part of the sequence.
Output
Generally, output consists of two words that have the same quantity of vowels. They must be the two words (for which this condition holds) that we can detect as early as possible. That is, all words appearing before the second one have different quantities of vowels. In case no such pair exist, the output of the program must be the single word "no".
Input
invocation of functions where several parameters are needed is deprecated XXX
Output
functions several
Input
one two seventeen sixteen supercalifragilisticexpialidocious dgt XXX
Output
no