Palindromes
Background:
A palindrome is a string that reads the same both backwards and forwards.
For example, atoyota is a palindrome because if you read it backwards,
you get atoyota again. By a warped coincidence, palindrome is not
a palindrome.
Input:
Each line of input will be one test case. Each test case has
a string of no more than 80 characters. All the characters
will be lower case letters. There will be no spaces, or
other characters on the line.
Output:
The word, yes, in all lower case if the given input is a palindrome.
Output no otherwise.
Sample Input:
atoyota
palindrome
Sample Output:
yes
no