#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

string S;

void solve() {
    cin>>S;
    
    int up = 0;
    bool finishing = false;
    bool ng = true;
    RREP(i,S.size()) {
        int n = (S[i]-'0') - up;
        up = 0;
        if (!finishing && 2 <= n && n <= 4) {
            ng = false; // 1回は必要
            up = 1;
            continue;
        }
        if (n == 6 || n == 7) {
            finishing = true;
            continue;
        }
        if (n==0 && i==0) {
            // 最後の桁として桁上りがあった場合
            continue;
        }
        ng = true;
        break;
    }
    
    cout << ((up||ng) ? "No" : "Yes") << endl;
}