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:
a = "AHIMOoTUVvWwXxYbdpq"
b = "AHIMOoTUVvWwXxYdbqp"
s = input()
l, r = 0, len(s)-1
f=True
while l<=r:
    if s[l] in a:
        i1=a.index(s[l])
    else:
        i1=-1
    if s[r] in b:
        i2=b.index(s[r])
    else:
        i2=-1
    if i1==-1:
        f=False
        break
    if i1!=i2:
        f=False
        break
    l+=1
    r-=1
if f:
    print("TAK")    
else:
    print("NIE")