Today is Viktor's first day of school at Kernel Bye Secondary School!

Having moved from across the country, Viktor doesn't have any friends and is looking to make some. However, ever since he was a child, he has hated vowels. As a result, he is only willing to befriend people whose names have no more than \(2\) vowels.

Viktor has a list of everyone in his grade, but doesn't know how to read. Because of this, he comes to you for help in finding everyone that he can befriend. Can you help him?

Note: The set of vowels is \(\{a,e,i,o,u\}\).

Input

The first line will contain a positive integer \(N\), representing the number of people in Viktor's grade.

The next \(N\) lines will each contain a single string \(S_{i}\), representing the name of the \(i\)-th student.

Output

Output each person that Viktor can befriend on their own line in the order that they were given in the input.

Constraints

\(1 \le N \le 10^{5}\)

\(1 \le |S| \le 10\)

It is guaranteed that all letters in the names are part of the English alphabet.

Sample Input 1

5
Bob
Allen
Jeff
Sheridan
Dave

Sample Output 1

Bob
Allen
Jeff
Dave

Explanation for Sample Output 1

Of all the names in the input, Sheridan is the the only name with more than \(2\) vowels as it has \(3\) - e, i, and a. Note that while there are uppercase letters, they are treated the same as lowercase letters. For example, A is still a vowel despite being uppercase.