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:
s = input()

sym = "AHIMOoTUVvWwXxY"
mir = {'b': 'd', 'd': 'b', 'p': 'q', 'q': 'p'}

ans = True
l = len(s)
if l % 2 != 0 and s[l // 2] not in sym:
    ans = False
else:
    #ans = False
    for i in range(l // 2):
        if not (s[i] in mir and mir[s[i]] == s[l - i - 1] or s[i] in sym and s[i] == s[l - i - 1]):
            ans = False
            break
print("TAK" if ans else "NIE")