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:
symmetric = [ 'A', 'H', 'I', 'M', 'O', 'o', 'T', 'U',
              'V', 'v', 'W', 'w', 'X', 'x', 'Y' ]
mirror = { 'p': 'q', 'q': 'p', 'b': 'd', 'd': 'b' }
for ch in symmetric:
  mirror[ch] = ch
s = raw_input().strip()
okay = True
for i in range((len(s) + 1) // 2):
  a, b = s[i], s[len(s) - 1 - i]
  if a not in mirror or b not in mirror or mirror[a] != b:
    okay = False
    break
print('TAK' if okay else 'NIE')