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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
char c[300];
string s;
int main() {
  c['A'] = 'A';
  c['H'] = 'H';
  c['I'] = 'I';
  c['M'] = 'M';
  c['O'] = 'O';
  c['T'] = 'T';
  c['U'] = 'U';
  c['V'] = 'V';
  c['W'] = 'W';
  c['X'] = 'X';
  c['Y'] = 'Y';
  c['b'] = 'd';
  c['d'] = 'b';
  c['o'] = 'o';
  c['p'] = 'q';
  c['q'] = 'p';
  c['v'] = 'v';
  c['w'] = 'w';
  c['x'] = 'x';
  cin >> s;
  for (int i = 0, j = s.size() - 1; i <= j; ++i, --j)
    if (c[s[i]] != s[j]) {
      puts("NIE");
      return 0;
    }
  puts("TAK");
}