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;
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
int main() {
  int n;
  string s;
  map<char, char> mp;
  mp['A'] = 'A';
  mp['b'] = 'd';
  mp['d'] = 'b';
  mp['H'] = 'H';
  mp['I'] = 'I';
  mp['M'] = 'M';
  mp['O'] = 'O';
  mp['o'] = 'o';
  mp['T'] = 'T';
  mp['U'] = 'U';
  mp['V'] = 'V';
  mp['W'] = 'W';
  mp['w'] = 'w';
  mp['v'] = 'v';
  mp['X'] = 'X';
  mp['x'] = 'x';
  mp['Y'] = 'Y';
  mp['p'] = 'q';
  mp['q'] = 'p';
  cin >> s;
  int flag = 1;
  for (int i = 0, j = s.size() - 1; i < s.size(); i++, j--) {
    if (s[i] != mp[s[j]]) flag = 0;
  }
  if (flag)
    puts("TAK");
  else
    puts("NIE");
}