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:
from string import ascii_lowercase as lowercase
from string import ascii_uppercase as uppercase



selfSym = "AHIMOoTUVvWwXxY"
pair = {a:b for a, b in zip("bdpq", "dbqp")}

    

def mirror(a, b):
    if a == b: return a in selfSym
    return a in pair and pair[a] == b

s = input().strip()
z = s[::-1]
for a, b in zip(s, z):
    if not mirror(a, b):
        print("NIE")
        exit(0)
print("TAK")