Nicholas Hathaway, a young programmer, always wanted to be a part of a hacking group, named fsociety and he is fortunate to find that fsociety is currently accepting more members but, this is not a simple task. He had to pass a challenge to become a member of fsociety. The challenge is to encrypt a string using modified ROT13 algorithm.
ROT13 is a simple letter substitution cipher that replaces a letter with the letter 13 letters after it in the alphabet. Similiarly for any ROTn each letter of string is replaced by the letter n letters after it.
For each test case, output the modified string followed by a newline.
1 ≤ T ≤ 100
1 ≤ Length of string ≤ 1000
Sample Test Case 1:
Letters l, i, v, e, t and h are occurring for the first time so apply ROT13 on them. Next letter e occurred second time so apply ROT14 on it. Now, next letters o and d are occurring for the first time so apply ROT13 on them. Next letter e occurred third time, so apply ROT15 on it. Therefore, output is yvirguspbqt.
Sample Test Case 2:
Similarly, output is pbqrszoynmt.