#include <bits/stdc++.h>
using namespace std;
int d[] = {8, -1, -1, 3, 6, 9, 4, 7, 0, 5};
long long n, num[15], sz;
bool ok = true;
int main() {
  cin >> n;
  while (n) {
    num[sz++] = n % 10;
    n /= 10;
  }
  for (int i = 0; i < sz && ok; i++)
    if (d[num[i]] != num[sz - i - 1]) ok = false;
  if (ok)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
