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:
# You lost the game.
s = str(input())
n = len(s)

sym = "AHIMOoTUVvWwXxY"

if n % 2 and sym.count(s[n//2]) == 0:
    print("NIE")
else:
    r = ""
    ok = 1
    for i in range(n//2):
        if sym.count(s[i]):
            r = s[i] + r
        elif s[i] == "b":
            r = "d" + r
        elif s[i] == "d":
            r = "b" + r
        elif s[i] == "p":
            r = "q" + r
        elif s[i] == "q":
            r = "p" + r
        else:
            ok = 0
            break
    if ok == 0:
        print("NIE")
    else:
        if s[n//2 + n%2:] == r:
            print("TAK")
        else:
            print("NIE")