
// Problem : B - Palindrome with leading zeros
// Contest : AtCoder - AtCoder Beginner Contest 198
// URL : https://atcoder.jp/contests/abc198/tasks/abc198_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007 //998244353
#define lld long double
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; i++)
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define w(x)  int x; cin>>x; while(x--)
using namespace std;
const long long N=200005, INF=2000000000000000000;

/*------------- Modular exponentiation -------------*/
int power(int a, int b, int p)
    {
        if(a==0)
        return 0;
        int res=1;
        a%=p;
        while(b>0)
        {
            if(b&1)
            res=(res*a)%p;
            b>>=1;
            a=(a*a)%p;
        }
        return res;
    }
	

/*------------- Sieve --------------*/	
vector <int> prime;
bool is_composite[N];

void sieve (int n) {
	fill (is_composite, false);
	for (int i = 2; i < n; ++i) {
		if (!is_composite[i]) prime.push_back (i);
		for (int j = 0; j < prime.size () && i * prime[j] < n; ++j) {
			is_composite[i * prime[j]] = true;
			if (i % prime[j] == 0) break;
		}
	}
}


/*------------ Utitlity function ---------------*/
void print(bool n){
    if(n){
        cout<<"Yes";
    }else{
        cout<<"No";
    }
}


int32_t main()
{
    IOS;
    int n;
    cin>>n;
    if(n==0){
    	print(1);
    	return 0;
    }
    while(n%10==0) n/=10;
    string s = to_string(n);
    bool ok=1;
    for(int i=0;i<s.size();i++){
    	int j = s.size()-1-i;
    	if(s[i]!=s[j]){
    		ok=0;
    		break;
    	}
    }
    print(ok);
}

// Written by abhidot
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
main()
{
    int n,i;
    cin>>n;
    int d=n/100;d++;
    cout<<100*d-n<<endl;
}
