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:
f = input()

p = 'aBCcDEeFfGghiJjKkLlmNnPQRrSstuyZz'

for c in f:
    if c in p:
        print('NIE')
        exit()

def trans(c):
    d = {
        'b': 'd',
        'd': 'b',
        'p': 'q',
        'q': 'p',
    }
    if c in d:
        return d[c]
    return c

t = ''.join(map(trans, f[::-1]))
if t == f:
    print('TAK')
else:
    print('NIE')