Rune

Akara is a great wizard of Sanctuary. She is interested in runes, the letters of an ancient language that strengthen magic items and spells. Her recent studies show that some runes are more powerful than others.

Runes from the Anglo-Saxon language.

The power of a rune is the number of vowels (a, e, i, o, u) in its name, except that a group of adjacent vowels counts only once. For example:

1. The rune named 'gattaca' has power 3, because its name holds 3 vowels and none of them are adjacent.
2. The rune named 'beautiful' also has power 3. Its name holds 5 vowels, but 'eau' is a group of adjacent vowels and counts as one.

Each language has its own runes and runes of different languages are never mixed. Akara wants to rank the runes she knows in each language so she can find them later. Your task, as her apprentice, is to read the rune list of each language and print its runes from the most powerful to the least powerful. Runes of equal power are printed in lexicographical order.

The first line contains $L$, the number of languages Akara is interested in. ($1 < L \le 10$)

Each of the next $L$ lines starts with $N$, the number of runes in that language ($1 < N \le 10^5$), followed by $N$ space separated strings $W$, one for each rune. Every string $W$ consists of lowercase English letters (a-z) only and its length is at most 100.

Print $L$ lines. Each line contains the $N$ runes of one language, separated by a single space. Print the more powerful runes first, and order runes of equal power lexicographically.