#include <bits/stdc++.h>
using namespace std;
int a[15],tot;
int main(){
	int n;
	scanf("%d",&n);
	if(n==0){
		printf("Yes");
		return 0;
	}
	while(n%10==0)n/=10;
	while(n){
		a[++tot]=n%10;
		n/=10;
	}
	int flag=1;
	for(int i=1;i<=tot;i++)if(a[i]!=a[tot+1-i])flag=0;
	printf(flag?"Yes":"No");
}
#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>

#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert

#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}

using namespace std;

template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}

/* Some Libraries */

//-------------------------------------------------

bool ispelin(const string &s)
{
    int N = s.size();
    bool res=true;
    rep(i,N/2){
        if (s[i]!=s[N-i-1]) res=false;
    }
    return res;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    string S; cin>>S;
    int N = S.size();
    bool yes=false;
    rep(i,N){
        if (ispelin(S)){
            yes=true;
            break;
        }
        S="0"+S;
    }
    cout<<(yes?"Yes":"No")<<"\n";
    return 0;
}
