s-palindrome

题意翻译

给出一个字符串，判断这个字符串中间是否是对称的。 是输出“TAK”，不是输出“NIE”。 @[chen_zhe](/space/show?uid=8457) @[yjjr](/space/show?uid=5088)

题目描述

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.

输入输出样例

输入样例 #1

oXoxoXo

输出样例 #1

TAK

输入样例 #2

bod

输出样例 #2

TAK

输入样例 #3

ER

输出样例 #3

NIE