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
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j, k, f;
  string s;
  char cap[15] = {'A', 'H', 'I', 'M', 'O', 'T', 'U', 'V',
                  'W', 'X', 'Y', 'o', 'v', 'w', 'x'};
  cin >> s;
  i = 0;
  j = s.length() - 1;
  while (i <= j) {
    if (s[i] == s[j]) {
      for (k = 0; k < 15; k++) {
        if (s[i] == cap[k]) break;
      }
      if (k >= 15) {
        break;
      }
    } else {
      if ((s[i] == 'b' && s[j] == 'd') || (s[i] == 'd' && s[j] == 'b'))
        ;
      else if ((s[i] == 'p' && s[j] == 'q') || (s[i] == 'q' && s[j] == 'p'))
        ;
      else
        break;
    }
    i++;
    j--;
  }
  if (i <= j)
    cout << "NIE\n";
  else
    cout << "TAK\n";
  return 0;
}
