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 = 'xXAHIMoOTUVvWwY'
d = {'bd', 'pq'}
s = input()
n = len(s)
res = True
for i in range(n):
    x, y = s[i], s[n - i - 1]
    if x == y and x in a: continue
    if x + y in d or y + x in d:
        continue
    print("NIE") 
    exit()
print("TAK")