Palindrome name check

Problem

A word is a palindrome if it reads the same from both ends, like Madam or Noon. Read one word and print YES if it is a palindrome and NO otherwise. Capital and small letters count as the same.

Input, output and limits

Input: One line: a single word.
Output: YES or NO.
Constraints: 1 ≤ length of the word ≤ 1000
The word has letters and digits only, no spaces

Examples

Example 1

Input

Madam

Output

YES

m-a-d-a-m after ignoring case.

Example 2

Input

Java

Output

NO

Hints

Try the problem first. Open one hint at a time.

Hint 1

Change the word to lowercase first.

Hint 2

Compare the first and last characters, then the second and second-last, and so on. Stop as soon as one pair differs.

Write your Java code, run it on the examples and submit it to hidden tests.

Solve in the editor

Reverse a coupon codeeasy
Word counter with extra spaceseasy
Ticket code first and lasteasy
Count a letter in feedbackeasy
Vowel and consonant countereasy

All Java problems

Problem

Input, output and limits

Examples

Hints

More Strings problems

Problem

Input, output and limits

Examples

Hints

More Strings problems