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

int main() {
  string N;
  cin >> N;
  string n;
  reverse_copy(N.begin(), N.end(), back_inserter(n));
  
  int count = 0;
  for (int i = 0; i < N.size(); i++) {
    if (N.at(i) == '0') {
      count++;
    }
  }
  int f = 0;
  for(int i = 0; i < count + 1; i++){
    if(N == n){
      f = 1;
      break;
    }
    N = "0" + N;
    n = n + "0";
  }
  
  if(f == 1)  cout << "Yes" << endl;
  else cout << "No" << endl;
}

#include <bits/stdc++.h> 
using namespace std;
#define ll long long
#define int long long
#define index(i, n) for(ll i = 0; i < n; i++)
#define loop(i, a, b) for(ll i = a;i<b;i++)
long long binpow(long long a, long long b) {
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
bool is_pelin(int n) {
    vector<int>arr;
    while(n){
        arr.push_back(n%10);
        n /= 10;
    }
    n = arr.size();
    for(int i = 0;i<n/2;i++){
        if(arr[i] != arr[n - 1 - i])return false;
    }
    return true;
}
int count_zero(int n){
    int temp = 0;
    int cnt = 0;
    while(n){
        temp = n&10;
        if(temp != 0)break;
        n/=10;
        cnt++;

    }
    return cnt;
}
bool is_rem(int n){
    vector<int>arr;
    while(n){
        arr.push_back(n%10);
        n /= 10;
    }
    int check = 0;
    index(i, arr.size()) {
        if(arr[i] != 0){
            check = i;
            break;
        }
    }
    int ans = 0;
    int j = 0;
    loop(i, check, arr.size()){
        ans += binpow(10, j) * arr[i];
        j++; 
    }
    if(is_pelin(ans))return true;
    return false;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    #ifndef ONLINE_JUDGE
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    # endif
    int n;
    cin >> n;
    if(is_pelin(n)){
        cout << "Yes";
    }
    else{
        if(is_rem(n)){
            cout << "Yes";
        }
        else{
            cout << "No";
        }
    }
    return 0;
}