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.*;

public class Q2 {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String s = in.nextLine();

		// StringBuilder sym = new StringBuilder("AHIMOoTUVvWwXxY");
		String sym = "AHIMOoTUVvWwXxY";

		boolean sp = true;
		int len = s.length();
		for (int i = 0; i < len / 2; i++) {

			if (s.charAt(i) == s.charAt(len - i - 1) && sym.indexOf(s.charAt(i)) >= 0)
				continue;
			if (s.charAt(i) == 'b' && s.charAt(len - i - 1) == 'd')
				continue;
			if (s.charAt(i) == 'd' && s.charAt(len - i - 1) == 'b')
				continue;
			if (s.charAt(i) == 'p' && s.charAt(len - i - 1) == 'q')
				continue;
			if (s.charAt(i) == 'q' && s.charAt(len - i - 1) == 'p')
				continue;
			sp = false;
			break;
		}

		if (sp) {
			if ((len % 2 == 1 && sym.indexOf(s.charAt(len / 2)) >= 0) || len % 2 == 0) {
				System.out.println("TAK");

			} else {
				System.out.println("NIE");
			}
		}
		else {
			System.out.println("NIE");
		}
	}
}