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;
const int mod = 1e5 + 7;
const int N = 1e5 + 5;
int main() {
  string s, ori;
  cin >> s;
  ori = s;
  map<char, char> mirror;
  mirror['A'] = 'A';
  mirror['H'] = 'H';
  mirror['I'] = 'I';
  mirror['M'] = 'M';
  mirror['O'] = 'O';
  mirror['o'] = 'o';
  mirror['T'] = 'T';
  mirror['U'] = 'U';
  mirror['V'] = 'V';
  mirror['v'] = 'v';
  mirror['W'] = 'W';
  mirror['w'] = 'w';
  mirror['X'] = 'X';
  mirror['x'] = 'x';
  mirror['Y'] = 'Y';
  mirror['b'] = 'd';
  mirror['d'] = 'b';
  mirror['p'] = 'q';
  mirror['q'] = 'p';
  for (long long i = 0; i < s.size(); i++) {
    s[i] = mirror[s[i]];
  }
  reverse(s.begin(), s.end());
  if (s == ori)
    cout << "TAK";
  else
    cout << "NIE";
  return 0;
}