#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
  string s;cin >> s;
  bool flag=false;
  ll clock=-1;
  while(s.size()){
    clock++;
    ll p=s.back()-'0';
    if(!flag){
      if(p==2||p==3||p==4){
        s.pop_back();
        bool carry=false;
        per(i,s.size()){
          if(s[i]>='1'){
            s[i]--;carry=true;break;
          }
          else{
            s[i]='9';
          }
        }
        if(!carry){
          cout << "No" << endl;return 0;
        }
        continue;
      }
    }
    if(clock&&(p==6||p==7)){
      flag=true;s.pop_back();
      continue;
    }
    if(p==0){
      if(s.size()==1){
        cout << "Yes" << endl;return 0;
      }
    }
    cout << "No" << endl;return 0;
  }
  cout << "Yes" << endl;
}