#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef unsigned long long ull;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e6 + 10;
const int nx[8] = {0, 0, 1, -1, -1, 1, 1, -1}, ny[8] = {1, -1, 0, 0, 1, -1, 1, -1}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

//Geometry
typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()
#define pi 3.14159265359


int main()
{
    boost;
    IO();

    str n;
    cin >> n;

    if(n=="0")
    {
        cout << "Yes" << endl;
        return 0;
    }

    int len = (int)n.length();

    int j = len-1;
    while(n[j]=='0'&&j>=0)
    {
        n = '0' + n;
    }

    len = (int)n.length();
    bool flag = true;
    FOR(i, 0, len/2)
    {
        if(n[i]!=n[len-i-1])
        {
            flag = false;
            break;
        }
    }

    if(flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    return 0;
}

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

bool palind(string nb){
    int i = 0;
    int j = nb.size() - 1;

    bool palind = true;
    while (i <= j & palind == true){
        if (nb[i] == nb[j]){
            i += 1;
            j -= 1;
        }
        else{
            palind = false;
        }
    }
    return palind;
}

int numberOfZeros(string nb){
    int i = nb.size() - 1;
    int nbOfZero = 0;
    while (i >= 0 & nb[i] == '0'){
        nbOfZero += 1;
        i--;
    }
    return nbOfZero;
}

int main(){

    int number;
    cin >> number;
    string numberInString = to_string(number);
    string nbAfterAdd;
    
    if (palind(numberInString)){
        cout << "Yes";
    }
    else if (numberOfZeros(numberInString) != 0){
        for (int i = 0; i < numberOfZeros(numberInString); i++){
            nbAfterAdd += '0';
        }
        nbAfterAdd += numberInString;
        if (palind(nbAfterAdd)){
            cout << "Yes";
        }
        else{
            cout << "No";
        }
    }
    else{
        cout << "No";
    }
}