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 PYTHON3):

Solution:
d = "AHIMOoTUVvWwXxY"

s = input()

for i in range(len(s) // 2 + 1):

	if not (s[i] in d and s[i] == s[-i-1] or s[i] + s[-i-1] in ["bd", "db", "pq", "qp"]):

		print("NIE")

		break

else:

	print("TAK")



# Made By Mostafa_Khaled