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:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main2 {
    private static char reverse(char c){
        if(c == 'A' || c == 'H' || c == 'I' || c == 'M' || c == 'O' || c == 'o' || c == 'T' || c == 'U' || c == 'V' || c == 'v' || c == 'W' || c == 'w' || c == 'X' || c == 'x' || c == 'Y'){
            return c;
        }
        else if(c == 'b'){
            return 'd';
        }
        else if(c == 'd'){
            return 'b';
        }
        else if(c == 'p'){
            return 'q';
        }
        else if(c == 'q'){
            return 'p';
        }
        else{
            return '?'; //false
        }
    }

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        String s = sc.next();
        for(int i = 0; i<s.length(); i++){
            if(s.charAt(i) != reverse(s.charAt(s.length()-1-i))){
                System.out.println("NIE");
                System.exit(0);
            }
        }
        System.out.println("TAK");
    }
}