codeforces 863A && Educational Codeforces Round 29 Quasi-palindrome

A. Quasi-palindrome

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 109). 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

题目大意：给你一个字符串，让你判断它是否是回文串，如果加上几个前导0能使它回文那么也算是一个回文串

其实普通的回文很好判断，重点是在前导0的情况，如果需要添加前导0，那么原字符串后边肯定也有0，那么我们就将后边的0去掉再判断一下就行了

#include<bits/stdc++.h>
using namespace std;
int main(){
	string str,tmp,ans;
	cin>>str;
	tmp=str;
	reverse(tmp.begin(),tmp.end());
	if(tmp==str){
		cout<<"YES"<<endl;
	}
	else{
		int flag=0;
		for(int i=str.size()-1;i>=0;i--){
			if(str[i]!='0'){
				ans.push_back(str[i]);
				flag=1;
			}
			else{
				if(flag) ans.push_back(str[i]);
				else continue;
			}
		}
		string res;
		res=ans;
		reverse(res.begin(),res.end());
		if(ans==res) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
}