class Solution:
    def __init__(self):
        self.stack=[]
        self.queue=[]
    def pushCharacter(self,char):
        self.stack.append(char)
        return self.stack
    def popCharacter(self):
        return self.stack.pop()
    def enqueueCharacter(self,char):
        self.queue.append(char)
        return self.queue
    def dequeueCharacter(self):
        return self.stack.pop(0)
    # Write your code here

# read the string s
s=input()
#Create the Solution class object
obj=Solution()   

l=len(s)
# push/enqueue all the characters of string s to stack
for i in range(l):
    obj.pushCharacter(s[i])
    obj.enqueueCharacter(s[i])
    
isPalindrome=True
'''
pop the top character from stack
dequeue the first character from queue
compare both the characters
''' 
for i in range(l // 2):
    if obj.popCharacter()!=obj.dequeueCharacter():
        isPalindrome=False
        break
#finally print whether string s is palindrome or not.
if isPalindrome:
    print("The word, "+s+", is a palindrome.")
else:
    print("The word, "+s+", is not a palindrome.")    

class Solution{
  
  constructor(){
    this.stack = [];
    this.queue = [];
  }
  
  pushCharacter(char){
    //store original array here
    this.stack.push(char);
  }  
    
  enqueueCharacter(char){
    //store reverse array here
    this.queue.unshift(char);
  }
  
  popCharacter(){
    //return first character from stack
    return this.stack.pop();
  }
  
  dequeueCharacter(){
    //return first character from queue
    return this.queue.pop();
  }
  
}

class Solution:
    def __init__(self):
        self.stack=[]
        self.queue=[]
    def pushCharacter(self,x):
        self.stack.append(x)
    def enqueueCharacter(self,x):
        self.queue.insert(0,x)
    def popCharacter(self):
        return self.stack.pop()
    def dequeueCharacter(self):
        return self.queue.pop()