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:
from sys import stdin
a = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
b = 'A******HI***M*O****TUVWXY*'
c = 'abcdefghijklmnopqrstuvwxyz'
d = '*d*b**********oqp****vwx**'
di = {}
for i in xrange(26):
 di[a[i]] = b[i]
 di[c[i]] = d[i]
a = stdin.readline().strip()
n = len(a)
b = ''
ans = 'TAK'
for i in xrange(n):
 b+=di[a[n-1-i]]

if b!=a:
 ans = 'NIE'
print ans