Marko is going to write a secret letter to a friend. He thought it is better to encrypt letter so that no other person can read it. After long thought he came up with an encryption scheme which was lame but he thought it will work anyways.

To encrypt a text he first wrote two infinite strings of characters first string consists only of vowels and second string consists of consonants only.

aeiouaeiouaeiouaeiouaeiou....................
bcdfghjklmnpqrstvwxyzbcdfghjklmnpqrstvwxyz...
 
Following is the scheme for encryption :

1. let c be any character to be encrypted.
2. let k be the count of number of times c character occurred in text to be encrypted until now.
3. first find which of two infinite string contains that character.
4. then look for kth occurrence of that character in that string.
5. replace character c by corresponding character in second string.

For example, encrypted text of "baax" will be "abho".

Input

First line of input will contains t, number of test cases. Then t test case follows each test case in a line. Each test case will be a string of small Latin alphabets. Length of string will be less than 5*10^4

Output

For each test case print encrypted text.

Sample :

Input:

2
baax
aaa

Output:

abho
bhn