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:
#!/usr/bin/python3

def main():
	s = input()
	spal = True
	#print( spal )
	ss = ""
	for i , c in enumerate( s[::-1] ):
		if c in "WTYUIOAHXVMwoxv" :
			ss += c
		elif c in "qdbp":
			ss += "qdbp"[ 3 - "qdbp".index( c ) ]
		else:
			spal = False
			#print( "hey hey hey" , c )
			break

	if s != ss:
		spal = False

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

if __name__ == '__main__':
	main()