#K55237. Palindromic String Verification
Palindromic String Verification
Palindromic String Verification
Given a string \(S\), determine whether it is a palindrome. A string is considered a palindrome if it reads the same backward as forward, that is, \(S = S^{rev}\). For example, "madam" and "racecar" are palindromes, while "hello" is not.
Your task is to check the input string from stdin and output "YES" if it is a palindrome and "NO" otherwise.
inputFormat
The input consists of a single line containing the string \(S\).
outputFormat
Output "YES" if the string is a palindrome; otherwise, output "NO". The result should be printed to stdout.
## samplemadam
YES