s-palindrome

给出一个字符串，判断这个字符串是否对称。注意：`dxb` 算作对称因为 `d` 和 `b` 对称，`x` 的左半边和右半边对称；而 `aa` 不算对称。 是对称串则输出 `TAK`，否则输出 `NIE`。保证 $1\leqslant\vert s\vert\leqslant1000$。

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. English alphabetYou are given a string $ s $ . Check if the string is "s-palindrome".

The only line contains the string $ s $ ( $ 1<=|s|<=1000 $ ) which consists of only English letters.

Print "TAK" if the string $ s $ is "s-palindrome" and "NIE" otherwise.

oXoxoXo

TAK

bod

TAK

ER

NIE