691_B. s-palindrome
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
```python
rever = "AHIMOTUVWXYovwx"
rev = ["bd", "pq","db","qp"]
line = input().rstrip()
if len(line) & 1 and line[len(line) // 2] not in rever:
    print("NIE")
    exit()

l = len(line) // 2 - 1
r = len(line) // 2 if len(line) & 1 == 0 else\
    len(line) // 2 + 1

for i in range(len(line) // 2):
    if line[l] + line[r] not in rev and (line[l] not in rever or line[l] != line[r]):
        break
    l-=1
    r+=1
if l != -1 or r != len(line):
    print("NIE")
else:
    print("TAK")
```