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:
s = raw_input()
rev = {
	"o": "o",
	"x": "x",
	"b": "d",
	"p": "q",
	"d": "b",
	"q": "p",
	"v": "v",
	"x": "x",
	"w": "w",
	"H": "H",
	"I": "I",
	"O": "O",
	"X": "X",
	"W": "W",
	"U": "U",
	"T": "T",
	"V": "V",
	"Y": "Y",
	"A": "A",
	"M": "M",
}

t = "".join([rev.get(c, "@") for c in s[::-1]])
print "TAK" if t == s else "NIE"