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 PYTHON):

Solution:
from sys import stdin, stdout
# http://codeforces.com/contest/691/problem/b


str = stdin.readline().rstrip()

symmetry = {
    'o': 'o',
    'b': 'd',
    'd': 'b',
    'p': 'q',
    'q': 'p',
    'v': 'v',
    'w': 'w',
    'x': 'x',
    'O': 'O',
    'V': 'V',
    'W': 'W',
    'X': 'X',
    'Y': 'Y',
    'A': 'A',
    'H': 'H',
    'I': 'I',
    'M': 'M',
    'T': 'T',
    'U': 'U',
}

symmetricCenters = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y', 'o', 'v', 'w', 'x']

def solve(str):
    l = len(str)
    lhalf = l >> 1
    if (l % 2 != 0) and (str[lhalf] not in symmetricCenters):
        return "NIE"
    for i in range(lhalf):
        if (str[i] not in symmetry) or (symmetry[str[i]] != str[l - i - 1]):
            return "NIE"
    return "TAK"

print solve(str)