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 getM(s):
        q = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'
        r = 'A......HI...M.O....TUVWXY..d.b..........oqp....vwx..'
        return r[q.index(s)]

        
s = raw_input()

ans = True
i=0
n = len(s)
while i<=n/2:
        if s[i]!=getM(s[n-i-1]):
                ans = False
                break
        i+=1
if n==1:
        if s==getM(s):
                print 'TAK'
        else:
                print 'NIE'
        

elif ans:
        print 'TAK'
else:
        print 'NIE'