#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
void solve(int _t)
{
    int n; cin >> n;
    while (n && n % 10 == 0)
        n /= 10;
    string s = to_string(n);
    if (equal(s.begin(), s.end(), s.rbegin()))
        cout << "Yes";
    else
        cout << "No";
}
 
int main()
{
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int T = 1;
	for (int t = 1; t <= T; t++) solve(t);
}
#include <bits/stdc++.h>
using namespace std;
 
//Macros
#define ll long long
#define nl "\n"
#define gl " "
#define pf(x) for(auto a:x) cout<<a.first<<gl<<a.second<<nl; 
#define af(x) for(auto a:x) cout<<a<<gl;
 
//functions

int check_palindrome(string s);

int main(){
 
    ios::sync_with_stdio(0);
    cin.tie(0);

	string s;
	cin>>s;
	for(int i=0; i<20; i++){
		if(check_palindrome(s)){
			cout<<"Yes"<<nl;
			return 0;
		}
		s="0"+s;
	}
	cout<<"No"<<nl;
}


int check_palindrome(string s){
	for(int i=0,j=s.size()-1; i<s.size(); i++,j--){
		if(s[i]!=s[j]) return 0;
	}
	return 1;
}

