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 INF = 1e9;
const int N = 1000031;
char w[1000];
string st;
int main() {
  ios_base::sync_with_stdio(0);
  for (int i = 0; i <= 500; i++) w[i] = '.';
  w['A'] = 'A';
  w['H'] = 'H';
  w['I'] = 'I';
  w['M'] = 'M';
  w['O'] = 'O';
  w['o'] = 'o';
  w['T'] = 'T';
  w['U'] = 'U';
  w['V'] = 'V';
  w['v'] = 'v';
  w['W'] = 'W';
  w['w'] = 'w';
  w['X'] = 'X';
  w['x'] = 'x';
  w['Y'] = 'Y';
  w['b'] = 'd';
  w['d'] = 'b';
  w['p'] = 'q';
  w['q'] = 'p';
  cin >> st;
  string memo = st;
  for (int i = 0; i < st.size(); i++) {
    st[i] = w[st[i]];
  }
  reverse(st.begin(), st.end());
  if (st == memo)
    cout << "TAK";
  else
    cout << "NIE";
  cin.get();
  cin.get();
  return 0;
}