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:
def main():
  s = raw_input().strip()
  symm = set("AHIMOoTUVvWwXxY")
  mirr = {"b": "d", "p": "q", "d": "b", "q": "p"}
  n = len(s)
  h = n / 2
  if n % 2 > 0 and not s[h] in symm:
    return False
  for i in range(h):
    c = s[i]
    d = s[n - i - 1]
    if c == d and s[i] in symm:
      continue
    if c in mirr and mirr[c] == d:
      continue
    return False
  return True

print "TAK" if main() else "NIE"