← 返回题目
题库练习 s-palindrome
← 上一题 下一题 →

A10555 | s-palindrome

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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.

![](/uploads/acgo/image/38a6c0e845b5d877_294449c93054.jpeg)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
C++ 编辑器
输入
输出