#include <bits/stdc++.h>
using namespace std;

int main() {
	string n;
	cin>>n;
	int d =  n.size()-1;
	int count = 0 , c= 0;
		for(int i = d;i>=0; i-- ){
			if(n[i]=='0')c++;
			else break;
		}
		for(int i = 0;i<c; i++ ){
			n = '0'+n;
		}
		d = d + c ;
		for(int i = 0 ; i <= d/2 ;i++ ){
		if(n[i]!=n[d-i])count=2;
	}
	if(count == 0)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	
	return 0;
}
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <bitset>

#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
using namespace std;

int main() {
    string s;
    cin >> s;
    if (s == string(s.rbegin(), s.rend())) {
        cout << "Yes" << endl;
    }
    else {
        int n = atoi(s.c_str());
        while (n % 10 == 0) {
            n /= 10;
        }
        string ss = to_string(n);
        if (ss == string(ss.rbegin(), ss.rend())) {
            cout << "Yes" << endl;
        }
        else {
            cout << "No" << endl;
        }
    }
}
