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:
self_palindrome = ['A','H','I','M','O','o','T','U','V','v','W','w','X','x','Y']
with_palindrome = dict()
with_palindrome['d']='b'
with_palindrome['b']='d'
with_palindrome['p']='q'
with_palindrome['q']='p'
s = raw_input()
is_ok = True
for i in range(len(s)):
	if s[i] in self_palindrome:
		if s[i] != s[len(s)-i-1]:
			is_ok = False
	elif s[i] in with_palindrome:
		if s[len(s)-i-1] != with_palindrome[s[i]]:
			is_ok = False
	else:
		is_ok = False
if is_ok:
	print 'TAK'
else:
	print 'NIE'