Solve the mystery.  
Input:
String which consists of words(all the characters of any word are lower case letters) and punctuation marks(consists of {'.' , ',' , '?' , '!'}). Also every input string consists of one '*' in it.
It is guaranteed that strings doesn't start or end with space(' ') and only one answer exists for each case.  

Output:
Lower case letter.  

Constrains:
1 ≤ t ≤ 1000
2 ≤ length of string(n) ≤ 100  

Problem Setter : Vinay Kumar

SAMPLE INPUT
7
k! cats s*ack.
ah, s*tan sees natasha!
aibohphobi*
al lets della call ed ste*la.
amy, must i jujitsu *y ma?
aerata pat a*ea.
lollipop i * lol.

SAMPLE OUTPUT
t
a
a
l
m
r
l
import sys
test=input()
while test>0:
	string=raw_input()
	string=string.split(' ')
	string=('').join(string)
	string=string.split('.')
	string=('').join(string)
	string=string.split('?')
	string=('').join(string)
	string=string.split('!')
	string=('').join(string)
	string=string.split(',')
	string=('').join(string)
	string=list(string)
	l=len(string)-1
	i=0
	while(1):
		#print string[i],string[l]
		if(i>l):
			break
		if(string[i]=='*'):
			#z=string[l]
			print string[l]
			break
		elif(string[l]=='*'):
			#z=string[i]
			print string[i]
			break
		i+=1
		l-=1

	test-=1