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()
n = len(s)

ans = 'TAK'
for i in range(int(n/2)):
    j = n-i-1
    if s[i] == 'b' and s[j] == 'd':
        continue
    elif s[i] == 'p' and s[j] == 'q':
        continue
    elif s[i] == 'd' and s[j] == 'b':
        continue
    elif s[i] == 'q' and s[j] == 'p':
        continue
    elif (s[i] == 'A' or s[i] == 'H' or s[i] == 'I' or s[i] == 'M'
           or s[i] == 'O' or s[i] == 'o' or s[i] == 'T' or s[i] == 'U'
           or s[i] == 'V' or s[i] == 'v' or s[i] == 'W' or s[i] == 'w'
           or s[i] == 'X' or s[i] == 'x' or s[i] == 'Y') and (s[i] == s[j]):
        continue
    else:
        ans = 'NIE'
        break

if ans == 'NIE':
    print(ans)
elif n%2 == 0:
    print(ans)
else:
    i = int(n/2)
    if (s[i] == 'A' or s[i] == 'H' or s[i] == 'I' or s[i] == 'M'
           or s[i] == 'O' or s[i] == 'o' or s[i] == 'T' or s[i] == 'U'
           or s[i] == 'V' or s[i] == 'v' or s[i] == 'W' or s[i] == 'w'
           or s[i] == 'X' or s[i] == 'x' or s[i] == 'Y'):
        pass
    else:
        ans = 'NIE'
    print(ans)