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:
a=raw_input()
mida, n = "AHIMOTUVWXYovwx", len(a)
ref = {'b':'d', 'p':'q', 'd':'b', 'q':'p'}
if n & 1:
    if a[n/2] not in mida:
        print "NIE"
        exit(0)
i = (n-1)/2
while i>=0:
    if a[i] in mida and a[-i-1] == a[i]: i -= 1
    elif a[i] in ref and a[-i-1] == ref[a[i]]: i -= 1
    else:
        print "NIE"
        exit(0)
print "TAK"