599. s-palindrome
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputLet'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 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
| 难度等级： | 2 |
| 总通过次数： | 1 |
| 总提交次数： | 3 |
- implementation