Problem A - Palindromes!
------------------------
A palindrome is a string that reads the same forward and backward. An
L-palindrome is a string which is a palindrome if you ignore its first
character. An R-palindrome is a palindrome if its last character is
ignored. Given a string, decide whether it is a palindrome, an
L-palindrome, or an R-palindrome.
Input
-----
Each input line contains only a string of at least 1 and at most 25
uppercase letters. End of input is signaled by a line containing only
the word END, which should not be processed.
Output
------
For each input string, output one or more of the following messages:
string is not any type of palindrome.
string is a palindrome.
string is an L-palindrome.
string is an R-palindrome.
where string is the input string. If more than one message
applies, they should be output in the order given above.
Leave a blankline after the output for each input string.
Sample Input
------------
HELLOWORLD
OTTO
OTTOR
OROTOR
TOTO
END
Output for Sample Input
-----------------------
HELLOWORLD is not any type of palindrome.
OTTO is a palindrome.
OTTOR is an R-palindrome.
OROTOR is an L-palindrome.
TOTO is an L-palindrome.
TOTO is an R-palindrome.