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:
T=input()
while T>0:
    l = raw_input()
    st=""
    for char in l:
        if char.isalnum() or char=='*':
            st=st+char
    le = len(st)
    for i in range(0,le/2):
        if(st[i]=='*' or st[le-1-i]=='*'):
            if(st[i]=='*'):
                print st[le-1-i]
            else:
                print st[i]
    T=T-1