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
t=int(input())

while(t>0):
	s=raw_input()
	i=0
	j=len(s)-1
	while(i<j):
		x=s[i]
		y=s[j]
		first=0
		if((ord(x)<97 or ord(x)>122) ):
			if(x!='*'):
				i+=1
				first=1
		if((ord(y)<97 or ord(y)>122)):
			if(y!='*'):
				j-=1
				first=1
		if(first==0):
			if(x=='*'):
				print y
				break
			if(y=='*'):
				print x
				break
			i+=1
			j-=1
		
	t-=1