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.InputStream;
import java.io.PrintStream;
import java.util.Scanner;

/**
 */
public class Main691B {
	public static void main(String[] args) {
		run(System.in, System.out);
	}

	static String maj = "A******HI***M*O****TUVWXY*";
	static String min = "*d*b**********oqp****vwx**";

	public static void run(InputStream in, PrintStream out) {

		try (Scanner sc = new Scanner(in)) {
			String s = sc.nextLine();
			String res = go(s);

			out.print(res);
		}
	}

	private static String go(String s) {
		int n = s.length();

		for (int i = 0; i < (n + 1) / 2; i++) {
			char c = s.charAt(i);
			char d = s.charAt(n - 1 - i);

			if (c >= 'a' && c <= 'z' && min.charAt(c - 'a') != d) return "NIE";
			else if (c >= 'A' && c <= 'Z' && maj.charAt(c - 'A') != d) return "NIE";

		}
		return "TAK";
	}

}