s-palindrome

Description

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.

  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.

Sample Input

Input

oXoxoXo

Output

TAK

Input

bod

Output

TAK

Input

ER

Output

NIE

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int hui[15]={'A','H','I','M','O','o','T','U','V','v','W','w','X','x','Y'};

char st[1005];

int pan(char a,char b)
{
	int i;
	int k=0;
	if(a==b)
	{
		for(i=0;i<15;i++)
			if(a==hui[i])
			{
				k=1;
				break;
			}
	}
	else
	{
		if((a=='b'&&b=='d')||(a=='d'&&b=='b')
			||(a=='p'&&b=='q')||(a=='q'&&b=='p'))
			k=1;
	}
	return k;
}

int main()
{
	int i,k=1;
	scanf("%s",&st);
	int n=strlen(st);
	for(i=0;i<n/2;i++)
	{
		if(!pan(st[i],st[n-1-i]))
		{
			k=0;
			break;
		}
	}
	if(n&1)
		if(!pan(st[n/2],st[n/2]))
			k=0;
	if(k)
		printf("TAK\n");
	else
		printf("NIE\n");
	return 0;
}