Trolling#3262
The language of the trolls has consonants: \{h, k, m, r, t\}, and vowels: \{a, o, u\}. Each word begins with a consonant letter, and in a word there cannot be two consecutive vowels or consonants.
trolls in turn call the shortest word that none of the previous trolls has called. If there are several options, the troll chooses the smallest lexicographically. Lexicographic order h < k < m < r < t < a < o < u. In this case, words are compared first by the first letter. If the first letters are the same, for the second, etc.
Find the word that the -th troll will call.
The first line contains a single number 1 \le T \le 100, the number of test cases. Each of the subsequent lines contains one integer 1 \le N \le 10^9 – the number of trolls.
For each number of input data, output in a single line answer to the problem in accordance with the format specified in the example.
Example 1