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 = "AHIMOTUVWXYovwx"
b = "bdpq"
c = "dbqp"

l = list(zip(a, a)) + list(zip(b, c))

s = input()

def f(c):
    for x in l:
        if c == x[0]:
            return x[1]
    return ' '

t = ''.join(map(f, s[::-1]))

print("TAK" if s == t else "NIE")