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 PYTHON):

Solution:
# you are just fucking around, why don't take your time to solve another
# problem.

# stop wasting the time here

import sys

d = {
    'A': 'A',
    'H': 'H',
    'I': 'I',
    'M': 'M',
    'O': 'O',
    'T': 'T',
    'U': 'U',
    'V': 'V',
    'W': 'W',
    'X': 'X',
    'Y': 'Y',
    
    'b': 'd',
    'd': 'b',
    'o': 'o',
    
    'p': 'q',
    'q': 'p',
    'v': 'v',
    'w': 'w',
    'x': 'x',
}

s = raw_input()
n = len(s)

r = ''.join(map(lambda x: d.get(x, '$'), s[::-1]))

print 'TAK' if s == r else 'NIE'