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(raw_input(""))
punctuation = ['.' , ',' , '?' , '!',' ']

if t>1000 or t<1:
	print 'Error: Try Again!'
	t = raw_input("")
else:
	None

j = 0
while j<t:
	s = raw_input("")
	n = len(s)
	if n>=2 and n<=100:
		None
	else:
		print 'Enter valid string again'
		s = raw_input("")
	for i in punctuation:
	  s = s.replace(i,"")
	n = len(s)
	pos = s.index('*')
	letter = n - pos -1
	print s[letter]
	j += 1