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:
s = raw_input()
mir = "AHIMOoTUVvWwXxY"
pairs = {'p':'q', 'b':'d', 'q':'p', 'd':'b'}
n = len(s)
for l in mir:
    pairs[l] = l

if n % 2 == 1:
    if not s[n // 2] in mir:
        print "NIE"
        exit()

for i in xrange(n // 2):
    if s[i] not in pairs or s[n-i-1] not in pairs:
        print "NIE"
        exit()
    if s[i] != pairs[s[n-i-1]]:
        print "NIE"
        exit()
print "TAK"