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:
dictionary=["b","d","A","H","I","M","o","O","p","q","T","U","V","v","W","w","X","x","Y"]
def isPalindrome(s,lo,hi):
    if hi-lo<0:
        return True
    else:
        if s[lo] in dictionary and s[hi] in dictionary:
            if s[lo]==s[hi] and (s[lo]!="p" and s[lo]!="d" and s[lo]!="b" and s[lo]!="q"):
                return isPalindrome(s,lo+1,hi-1)
            elif (s[lo]=="b" and s[hi]=="d") or (s[lo]=="d" and s[hi]=="b"):
                return isPalindrome(s,lo+1,hi-1)
            elif (s[lo]=="p" and s[hi]=="q") or (s[lo]=="q" and s[hi]=="p"):
                return isPalindrome(s,lo+1,hi-1)
            else:
                return False
        else:
            return False
s=raw_input()
if isPalindrome(s,0,len(s)-1)==True:
    print "TAK"
else:
    print "NIE"