Codeforces863A-Quasi-palindrome

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.

Input

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

Output

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

Example

Input

131

Output

YES

Input

320

Output

NO

Input

2010200

Output

YES

题解：求一个数去掉后缀零后是否是回文串。直接模拟。

Code：

var
  n:longint;
function check(n:longint):boolean;
var s:string;i,j,l:longint;
begin
  str(n,s);
  l:=length(s);
  i:=1;j:=l;
  while (s[i]=s[j])and(i<=j) do
  begin
    inc(i);dec(j);
  end;
  if j-i<=0 then exit(true) else exit(false);
end;
begin
  readln(n);
  while n mod 10=0 do n:=n div 10;
  if check(n) then writeln('YES') else writeln('NO');
end.