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:
s=input()

symmetric='AHIMOoTUVvWwXxY'
symmetric_pair='bdb pqp'
len_s=len(s)
half_len=len_s//2
if len_s%2==1:
	if s[half_len] not in symmetric:
		print('NIE')
		exit()
for i in range(half_len):
	cur=s[i]
	cur_opposite=s[~i]
	if cur!=cur_opposite:
		if cur+cur_opposite not in symmetric_pair:
			print('NIE')
			exit()
	else:
		if cur not in symmetric:
			print('NIE')
			exit()
print('TAK')