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:
sym="AHIMOoTUVvWwXxY"
rev={'b':'d','d':'b','p':'q','q':'p'}
S=input()
N=len(S)
ok=True
for i in range(N // 2):
    o=S[N-i-1]
    ok &= (S[i] in sym and S[i] == o) or (S[i] in rev and rev[S[i]] == o)
if N & 1:
    ok &= S[N//2] in sym
print('TAK' if ok else 'NIE')