B. s-palindrometime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard 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".InputThe only line contains the string s (1 ≤ |s| ≤ 1000) which consists of only English letters.OutputPrint "TAK" if the string s is "s-palindrome" and "NIE" otherwise.ExamplesInputoXoxoXoOutputTAKInputbodOutputTAKInputEROutputNIE
InputoXoxoXo
OutputTAK
['implementation', 'strings', '*1600']