CF691B s-palindrome

Description

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. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF691B/4db2e6d4ff8e49af69a33905ad7864160ff04588.png)English alphabetYou are given a string $ s $ . Check if the string is "s-palindrome".

Input Format

The only line contains the string $ s $ ( $ 1

Output Format

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