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

Solution:
sym = "AHIMOTUVWXYovwx"
mir = {
    'p': 'q',
    'q': 'p',
    'd': 'b',
    'b': 'd',
}

def good(a, b):
    if a in sym and a == b:
        return True
    if a in mir and mir[a] == b:
        return True
    return False


def check(s: str) -> bool:
    for i in range(len(s)):
        j = len(s) - i - 1
        if i == j:
            if not s[i] in sym:
                return False
        if i != j:
            if not good(s[i], s[j]):
                return False
    return True


s = input()
print('TAK' if check(s) else 'NIE')