#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    string s;cin>>s;

    reverse(ALL(s));

    if(*min_element(ALL(s))>='6' and *max_element(ALL(s))<='7'){
        cout<<"No"<<endl;
        return 0;
    }

    s.push_back('0');

    int carry=0;
    int fin=0;
    rep(i,(int)s.size()){
        int dig=s[i]-'0';
        if(carry){
            if(fin==0 and 3<=dig and dig<=5) carry=1;
            else if(dig==1) fin=2,carry=0;
            else if(fin<=1 and 7<=dig and dig<=8) fin=1,carry=0;
            else{
                cout<<"No"<<endl;
                return 0;
            }
        }else{
            if(fin==0 and 2<=dig and dig<=4) carry=1;
            else if(dig==0) fin=2;
            else if(fin<=1 and 6<=dig and dig<=7) fin=1,carry=0;
            else{
                cout<<"No"<<endl;
                return 0;
            }
        }
    }
    cout<<"Yes"<<endl;
    return 0;
}