#K75797. Palindrome Check

    ID: 34499 Type: Default 1000ms 256MiB

Palindrome Check

Palindrome Check

Given an integer \( x \), determine whether it is a palindrome when read backwards. An integer is considered a palindrome if it remains unchanged when its digits are reversed. For example, if \( x = 121 \), then it is a palindrome because reversing its digits results in \( 121 \) again. However, if \( x < 0 \), it is not considered a palindrome.

Your task is to write a program that reads an integer from stdin and prints "Yes" to stdout if the integer is a palindrome, or "No" if it is not.

inputFormat

The input consists of a single line containing one integer \( x \).

outputFormat

Print a single line with "Yes" if \( x \) is a palindrome; otherwise, print "No".

## sample
121
Yes