Problem: Let's call a string "s-palindrome" if it is symmetric about the middle of the string. For example, the string "oHo" is "s-palindrome", but the string "aa" is not. The string "aa" is not "s-palindrome", because the second half of it is not a mirror reflection of the first half.

<image> English alphabet

You are given a string s. Check if the string is "s-palindrome".

Input

The only line contains the string s (1 ≤ |s| ≤ 1000) which consists of only English letters.

Output

Print "TAK" if the string s is "s-palindrome" and "NIE" otherwise.

Examples

Input

oXoxoXo


Output

TAK


Input

bod


Output

TAK


Input

ER


Output

NIE

Solution (in PYTHON):

Solution:
d={}
d['A']='A'
d['b']='d'
d['d']='b'
d['H']='H'
d['I']='I'
d['M']='M'
d['O']='O'
d['o']='o'
d['p']='q'
d['q']='p'
d['T']='T'
d['U']='U'
d['V']="V"
d['v']='v'
d['W']='W'
d['w']='w'
d['X']='X'
d['x']='x'
d['Y']='Y'
s=raw_input()
i=0
n=len(s)
j=n-1
while(i<=j):
    if((s[i] in d)==False):
        print "NIE"
        exit()
    if s[j]!=d[s[i]]:
        print "NIE"
        exit()
    i+=1
    j-=1
print "TAK"