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:
import re

s = input().strip()
t = re.sub('[^AbdHIMOopqTUVvWwXxY]{1}', '', s)

m = {}
for i in range(ord('A'), ord('z') + 1):
    m[chr(i)] = chr(i)

m['b'] = 'd'
m['d'] = 'b'
m['p'] = 'q'
m['q'] = 'p'

def is_sp():
    sl = len(t)
    for i in range(sl // 2 + 1):
        if m[t[i]] != t[sl - 1 - i]:
            return False
    return True

if len(t) == len(s):
    if is_sp():
        print('TAK')
    else:
        print('NIE')
else:
    print('NIE')