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:
n = raw_input()
m = {'b':'d', 'd':'b', 'p': 'q', 'q':'p'}
s = ['A', 'H', 'I', 'M', 'O', 'o', 'T', 'U', 'V', 'v', 'W', 'w', 'X', 'x', 'Y']
l = len(n)
if l == 1:
    if n[0] in s:
        print 'TAK'
    else:
        print 'NIE'
    exit()
for i in range(l/2+1):
    if (n[i] in m and n[l-i-1] == m[n[i]]) or (n[i] in s and n[l-i-1] == n[i]):
        continue
    else:
        print 'NIE'
        exit()
print 'TAK'