You are working for a software company. Your job is to convert all input strings into leet. The company has standardised only the following leet transformations -

A - 4
E - 3
I - !
L - 1
O - ()
S - 5

It is assured that all the input string consists only of uppercase latin alphabets.

Input Format:
First line of input contains an integer T, the number of test cases. T lines follow, each containing a string S, containing only uppercase latin alphabet.

Output Format:
Output contains T lines each having the leet transformation corresponding to each test case.

Constraints:
1 ≤ T ≤ 10
1 ≤ length of S ≤ 100000

Sample Input:
1
SOPHOMORE

Sample Output:
5()PH()M()R3