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:
'''input
oXo
'''

def r():
    return list(map(int, input().split()))

SYM_LETTERS = set('AHIMOoTUVvWwXxY')

mirror = {'b':'d', 'd':'b', 'p':'q', 'q':'p'}
for letter in SYM_LETTERS:
    mirror[letter] = letter

def is_s_palindrome(s):
    if not s:
        return True
    if len(s) == 1:
        return s in SYM_LETTERS
    if s[0] not in mirror or s[-1] != mirror[s[0]]:
        return False
    return is_s_palindrome(s[1:-1])

print('TAK' if is_s_palindrome(input()) else 'NIE')