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:


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

letter_trans = {
    'b': 'd',
    'd': 'b',
    'p': 'q',
    'q': 'p',
}

for letter in symmetric_letters:
    letter_trans[letter] = letter

word = input()

if all([x in letter_trans for x in word]) and \
        list(word) == [letter_trans[x] for x in word[::-1]]:
    print("TAK")
else:
    print("NIE")