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 PYTHON3):

Solution:
import sys, math
s=input()
pal='AHIMOoTUVvWwXxY'
n=len(s)
l=0
r=n-1
flag=True
fir='pq'
sec='bd'
while l<=r:
    if s[l]==s[r] and s[l] in pal:
        l+=1
        r-=1
        continue
    elif s[l]==s[r]:
        flag=False
        break
    elif (s[l] in fir) and (s[r] in fir):
        l+=1
        r-=1
        continue
    elif (s[l] in sec) and (s[r] in sec):
        l+=1
        r-=1
        continue
    else:
        flag=False
        break
if flag:
    print('TAK')
else:
    print('NIE')