#include <bits/stdc++.h>
using namespace std;
void solve() {
  int x;
  cin >> x;
  vector<int> v, orig;
  while (x) {
    v.push_back(x % 10);
    orig.push_back(x % 10);
    x /= 10;
  }
  int t = v.size() / 2;
  for (int i = 0, j = v.size() - 1; i < t; i++, j--) {
    int temp;
    temp = orig[i];
    orig[i] = orig[j];
    orig[j] = temp;
  }
  t = v.size() - 1;
  bool state = false;
  while (t >= 0) {
    if (orig[t] == v[t])
      state = true;
    else {
      state = false;
      break;
    }
    t--;
  }
  if (state) {
    cout << "YES"
         << "\n";
    return;
  }
  t = orig.size() - 1;
  int numZ = 0;
  while (t) {
    if (orig[t] == 0) numZ++;
    if (orig[t] != 0) break;
    t--;
  }
  state = false;
  for (int i = 0, j = i + numZ; i < v.size() - numZ; i++, j++) {
    if (v[j] == orig[i])
      state = true;
    else {
      state = false;
      break;
    }
  }
  if (!state)
    cout << "NO"
         << "\n";
  else
    cout << "YES"
         << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
}
