CF863A.Quasi-palindrome

Let quasi-palindromic number be such number that adding some leading zeros (possible none) to it produces a palindromic string.

String t is called a palindrome, if it reads the same from left to right and from right to left.

For example, numbers 131 and 2010200 are quasi-palindromic, they can be transformed to strings "131" and "002010200", respectively, which are palindromes.

You are given some integer number x. Check if it's a quasi-palindromic number.

称一个数为“准回文数”，是指在该数前面添加若干个前导零（可以不添加）后，能得到一个回文字符串。

字符串 $t$ 被称为回文串，当且仅当它从左到右读与从右到左读完全相同。

例如，数字 $131$ 和 $2010200$ 都是准回文数：它们可分别转化为回文字符串 "131" 和 "002010200"。

给定一个整数 $x$，请判断它是否为准回文数。

The first line contains one integer number x (1 ≤ x ≤ 109). This number is given without any leading zeroes.

第一行包含一个整数 $x$（$1 \le x \le 10^9$）。该数字不带任何前导零。

Print "YES" if number x is quasi-palindromic. Otherwise, print "NO" (without quotes).

如果数字 $x$ 是准回文数，则输出 “YES”；否则输出 “NO”（不带引号）。