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.util.Scanner;

public class B {
	private static String ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
	private static String ALPHABET_SYMMETRIC = "A      HI   M O    TUVWXY  d b          oqp    vwx  ";

	public static void main(String[] args) {
		try (Scanner s = new Scanner(System.in)) {
			final String text = s.next();
			int i = 0;
			int j = text.length() - 1;
			boolean res = true;
			while (i <= j) {
				if (text.charAt(i) != symmetric(text.charAt(j))) {
					res = false;
					break;
				}
				i++;
				j--;
			}
			System.out.println(res ? "TAK" : "NIE");
		}
	}
	
	private static Character symmetric(char c) {
		return ALPHABET_SYMMETRIC.charAt(ALPHABET.indexOf(c));
	}
}