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:
import math
sym = "AHIMOoTUVvWwXxY"

word = raw_input().strip()
cha = ""
chb = ""
if len(word) % 2 == 1:
    if word[len(word)/2] not in sym:
        print "NIE"
        exit()
cha = word[:len(word)/2]
chb = word[int(math.ceil(float(len(word))/2)):]
for i in range(len(word)/2):
    a = cha[-1-i]
    b = chb[i]
    if a == 'b':
        if b != 'd':
            print "NIE"
            break
    elif a == 'd':
        if b != 'b':
            print "NIE"
            break
    elif a == 'p':
        if b != 'q':
            print "NIE"
            break
    elif a == 'q':
        if b != 'p':
            print "NIE"
            break
    elif (a != b) or (a not in sym):
        print "NIE"
        break
else:
    print "TAK"