s-palindrome

1000ms

262144K

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.

$\text{[math]}$ 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.

Sample Input:

oXoxoXo

Sample Output:

TAK

Sample Input:

bod

Sample Output:

TAK

Sample Input:

ER

Sample Output:

NIE

Informação

Provedor Codeforces

Código CF691B