Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Quasi-palindrome

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLet 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.

Input

The first line contains one integer number *x* (1 ≤ *x* ≤ 10^{9}). This number is given without any leading zeroes.

Output

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

Examples

Input

131

Output

YES

Input

320

Output

NO

Input

2010200

Output

YES

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/13/2018 02:42:58 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|