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:
SelfSymetric = [
  'A','O','o', 'X','x', 'Y', 
  'M', 'H', 'I', 'T', 'U', 'V', 'v', 'W', 'w', ]
Pair = {
  'p' : 'q', 'q' : 'p', 
  'b' : 'd', 'd' : 'b', }

s = raw_input() 
t = s[::-1]

for p, q in zip(s, t) :
  if (p == q and p in SelfSymetric) or (p in Pair and Pair[p] == q) :
    continue
  print "NIE" 
  quit()
print 'TAK'