Problem: 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

Solution (in PYTHON):

Solution:
'''
Output is input_string[distance of * from end]
'''
t=input()
while t>0:
	t-=1
	string=raw_input()
	i=0
	starIndex=-1
	for char in string[::-1]:
		if char=='*':
			starIndex = i
		elif char.isalpha():
			i+=1
			
	for char in string:
		if char.isalpha() or char=='*':
			starIndex-=1
			if starIndex==-1:
				print char
				break