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


par = "AHIMOoTUVvWwXxY"
def main() :
    match = dict()
    match['p'] = 'q'
    match['q'] = 'p'
    match['b'] = 'd'
    match['d'] = 'b'
    for c in par :
        match[c] = c
    raw = raw_input();
    n = len(raw)
    ok = True
    for i in range(n) :
        if match.get(raw[i],False) == False :
            ok = False
        elif match[raw[i]] != raw[n - 1 - i] :
            ok = False
    if ok :
        print "TAK" 
    else :
        print "NIE"

main()