#include <iostream>
#include <string>
using namespace std;

int main(int argc, const char* argv[]){
    string n;
    cin >> n;

    int n_s = n.length()-1;

    while(n.at(n_s) == '0' && n_s != 0){
        n_s = n_s-1;
    }

    int n_min=0;
    int n_max=n_s;
    bool r_f=true;

    while(n_min < n_max) {
        if (n.at(n_min) != n.at(n_max)) {
            r_f=false;
        }
        n_min = n_min+1;
        n_max = n_max-1;
    }

    if(r_f){
        std::cout<<"Yes"<<endl;
    } else{
        std::cout<<"No"<<endl;
    }


}
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define sc(x) scanf("%d",&x)
#define fra(v) for(auto &it:v)
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL)
ll binaryExponentiation(ll x,ll n)
{
    ll result=1;
    while(n>0)
    {
        if(n % 2 ==1)
            result=result * x;
        x=x*x;
        n=n/2;
    }
    return result;
}
void SieveOfEratosthenes(ll n)
{
    bool prime[n+1];
    memset(prime, true, sizeof(prime));

    for (ll p=2; p*p<=n; p++)
    {

        if (prime[p] == true)
        {

            for (ll i=p*p; i<=n; i += p)
                prime[i] = false;
        }
    }
    for (ll p=2; p<=n; p++)
        if (prime[p])
            cout << p << " ";
}


int main()
{
    fastIO;
    ll t;
    t=1;
    while(t--)
    {
        string s,s1,x;
        cin>>s;
        x=s;
        reverse(x.begin(),x.end());
        if(s==x)
        {
            cout<<"Yes";
            continue;
        }
        ll a=0;
        ll l=s.size()-1;
        while(s[l]=='0')
        {
            a++;
            l--;
        }
        while(a--)
        {
            s1+='0';
        }
        s=s1+s;
        x=s;
        reverse(x.begin(), x.end());
        if(s==x)
        {
            cout<<"Yes" ;
        }
        else
        {
            cout<<"No" ;
        }
    }
}
