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:
s = raw_input()
l, r = 0, len(s)-1
while l <= r:
    if ((s[l] == s[r] and
         s[l] in ('A', 'H', 'I', 'M', 'O', 'o',
                  'T', 'U', 'V', 'v', 'W', 'w',
                  'X', 'x', 'Y')) or 
        (s[l] == 'b' and s[r] == 'd') or
        (s[l] == 'd' and s[r] == 'b') or
        (s[l] == 'p' and s[r] == 'q') or
        (s[l] == 'q' and s[r] == 'p')):
        l += 1
        r -= 1
        continue
    break
if l > r:
    print 'TAK'
else:
    print 'NIE'