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:
def isSpalin(s,d):
    n = len(s)
    for i in range(n):
        if s[i] not in d or d[s[i]]!=s[n-i-1]:
            return "NIE"
    return "TAK"
dd = {'b':'d','p':'q','q':'p','d':'b','A':'A','o':'o','x':'x','H':'H','I':'I','M':'M','O':'O','T':'T','U':'U','V':'V','v':'v','W':'W','w':'w','X':'X','Y':'Y'}
s = raw_input()
print isSpalin(s,dd)