Score : $100$ points

Problem Statement

$s$ is a string consisting of characters A, C, G, T. The length of $s$ is $N$．We denote $i$-th character of $s$ as s\[i\] ($1 \\leq i \\leq N$). We define a complementary character for A, C, G, T, respectively, such that the complementary character of A is T, that of T is A, that of C is G, and that of G is C. A complementary character of any character $a$ is denoted by $R(a)$. Under these definitions above, the reverse complement sequence of a string $s$ is defiend as: R(s\[N\]), R(s\[N-1\]),..., R(s\[2\]), R(s\[1\]). For example, the reverse complement sequence of AACGT is ACGTT.

Output all the reverse complement sequences of $m$ input sequences: $s_1$,...,$s_m$.

Constraints

• $s_1$,...,$s_m$ are strings consisting of A, C, G, T.
• $1 \\leq m<100$
• $1 \\leq |s_1|, \\ldots, |s_m| <1000$ (the length of $x$ is denoted by $|x|$.)

Input

Input is given from Standard Input in the following format:

$m$ $s1$ $s2$ $:$ $sm$

Output

Print reverse complement sequences of input sequences. Each sequence should be printed as a single line, and the order of the output sequences must be the same as the order of input sequences.

Sample Input 1

6
CATAGAACGACTATT
TA
GCGGCTTTTTGAAGCGT
TACCTTGATCA
GGCGTGCATAG
T

Sample Output 1

AATAGTCGTTCTATG
TA
ACGCTTCAAAAAGCCGC
TGATCAAGGTA
CTATGCACGCC
A