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.*;
import java.io.*;
/**
 *
 * @author umang
 */

public class B691 {

    public static void main(String[] args) {
 
        InputReader in = new InputReader(System.in);
        PrintWriter w = new PrintWriter(System.out);
        
        String str = in.readString();
        boolean flag = true;
        HashMap<Character,Character> map = new HashMap<>();
        map.put('A','A');
        map.put('H','H');
        map.put('I','I');
        map.put('M','M');
        map.put('O','O');
        map.put('o','o');
        map.put('T','T');
        map.put('U','U');
        map.put('V','V');
        map.put('v','v');
        map.put('W','W');
        map.put('w','w');
        map.put('X','X');
        map.put('x','x');
        map.put('Y','Y');
        HashMap<Character,Character> map1 = new HashMap<>();
        map1.put('b','d');
        map1.put('d','b');
        map1.put('p','q');
        map1.put('q','p');
        int n = str.length();
        for(int i=0;i<(n/2);i++){
			if(map.containsKey(str.charAt(i))){
				if(map.get(str.charAt(i))!=str.charAt(n-i-1)){
					flag=false;
					break;
				}
			}
			else if(map1.containsKey(str.charAt(i))){
				if(map1.get(str.charAt(i))!=str.charAt(n-i-1)){
					flag=false;
					break;
				}
			}
			else{
				flag=false;
				break;
			}
		}
        
        if(n%2!=0){			
			if(map.containsKey(str.charAt(n/2))){				
			}
			else{
				flag=false;
			}
		}
        
        if(flag) w.println("TAK");
        else w.println("NIE");
        w.close();
    }
    
	static class InputReader {

		private final InputStream stream;
		private final byte[] buf = new byte[8192];
		private int curChar, snumChars;
		private SpaceCharFilter filter;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public int nextInt() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public int[] nextIntArray(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public String readString() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
}