def isPalindrome():
    n = input()
    for i in range(int(len(n)/2)):
        if n[i].lower() != (n[(i+1)*-1]).lower():
            return("Not a Palindrome")
    return True        
print(isPalindrome())
a256952c68be08097c97da77e8aeae1e7b693f90
<mask token>

def isPalindrome():
    n = input()
    for i in range(int(len(n) / 2)):
        if n[i].lower() != n[(i + 1) * -1].lower():
            return 'Not a Palindrome'
    return True


<mask token>

def isPalindrome():
    n = input()
    for i in range(int(len(n) / 2)):
        if n[i].lower() != n[(i + 1) * -1].lower():
            return 'Not a Palindrome'
    return True


print(isPalindrome())

def isPalindrome():
    n = input()
    for i in range(int(len(n)/2)):
        if n[i].lower() != (n[(i+1)*-1]).lower():
            return("Not a Palindrome")
    return True        
print(isPalindrome())