039. Number Code (Easier Version)
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are using a code where letters in words map to digits in the following way:

0 = o

1 = i

3 = e

4 = a

5 = s

7 = t

(the other digits will not be used in this problem)

You've found a sequence of numbers, and you want to find which words the numbers correspond to using the code described above. For this problem, assume that the only letters in each word are the ones that map to numbers.

Input

The first line of input contains a positive integer T indicating the number of test cases that follow. Each of the next T lines contains a sequence of space-separated numbers consisting of the digits 0, 1, 3, 4, 5, and 7.

Output

Output T lines, with each line consisting of the decoded sequence of words using the code described above.

Example
Input
4
50 50
45 15
1 473 4 74573
17 15 70 517
Output
so so
as is
i ate a taste
it is to sit