Tanish loves alphabets. He loves alphabets so much that he ignores all other characters.
Also, whenever he is given an alphabet he gives the next alphabet in alphabetical order in same case.
For example, for a-b,for d-e,for z-a.
Given a string guess what would be Tanish's answer.


Input

The first line of the input contains an integer N denoting the number of strings. N strings follow.


Output

For each string, output a single line containing Tanish's answer.


Constraints

1 ≤ N ≤ 20
1 ≤ |s| ≤ 100 where |s| is the length of the string.


Example
Input:
4
nun123
1234
retA34
^ 56az

Output:
ovo

sfuB
ba


Explanation
Example For the second string, there is no output as there are no alphabets.
#V 1.01. Forgot to account for uppercase alphabets earlier -_-
T = (int)(raw_input())
while T:
	res = ""
	s = raw_input()
	for i in range(0, len(s)):
    	 if s[i].isalpha():
    	 	if ord(s[i])+1==123:
    		 	res = res + 'a'
    		elif ord(s[i])+1==91:
    			res = res + 'A'
    	 	else:
    	 		res=res+(chr(ord(s[i])+1))
    	print res
	T-=1