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;
int main() {
  map<char, char> m;
  m['A'] = 'A', m['H'] = 'H', m['I'] = 'I', m['M'] = 'M', m['O'] = 'O',
  m['T'] = 'T', m['U'] = 'U', m['V'] = 'V', m['W'] = 'W', m['X'] = 'X';
  m['b'] = 'd';
  m['d'] = 'b';
  m['o'] = 'o';
  m['p'] = 'q';
  m['q'] = 'p';
  m['v'] = 'v';
  m['w'] = 'w';
  m['x'] = 'x';
  m['Y'] = 'Y';
  string s;
  cin >> s;
  int len;
  if (s.size() % 2 == 0)
    len = (int)s.size() / 2;
  else
    len = ((int)s.size() / 2) + 1;
  for (int i = 0; i < len; i++) {
    if (s[i] != m[s[s.size() - 1 - i]]) {
      cout << "NIE\n";
      return 0;
    }
  }
  cout << "TAK\n";
}