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:
#!/usr/bin/env python3

def check(s):
    chars = 'AHIMOoTUVvWwXxY'
    sr = list(reversed(s))

    for i in range(len(s)):
        if s[i] not in chars + 'dbpq':
            return False
        if s[i] in chars and s[i] != sr[i]:
            return False
        for a, b in [('d', 'b'), ('b', 'd'),
                     ('q', 'p'), ('p', 'q')]:
            if s[i] == a and sr[i] != b:
                return False
    return True

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