Problem: 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.

<image> 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

Solution (in JAVA):

Solution:
var x = readline();

var a = "pq"+"bd"+"AHIMOoTUVvWwXxY";
var b = "qp"+"db"+"AHIMOoTUVvWwXxY";

var ok = true;
for (var i=0, j=x.length-1 ; ok && i<=j ; i++, j--)
{
    var m = a.indexOf(x[i]), n = b.indexOf(x[j]);
    ok = ok && m>=0 && m==n;
}

print(ok ? "TAK" : "NIE");