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 = input()
sym = "AHIMOoTUVvWwXxYpqbd"
opposite = "AHIMOoTUVvWwXxYqpdb"
ok = True
for i in range(len(A)):
    index = sym.find(A[i])
    # print(A[i], A[-i - 1], index, opposite[index])
    if index >= 0 and A[-i - 1] == opposite[index]:
        pass
    else:
        ok = False
        break
print("TAK") if ok == True else print("NIE")