#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <cassert>
#pragma GCC optimize("O3")
#pragma comment(linker, "STACK:36777216")
using namespace std;
using i64 = int64_t;
constexpr i64 MOD = 1e9 + 7;
using vi = vector<i64>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;

int main() {
    string s;
    cin >> s;
    bool all = true;
    bool one = false;
    
    for (int i = s.size() - 1; i >= 0; i--) {
        if (i == 0 && s[i] == '0') continue;
        if (s[i] == '6' || s[i] == '7') {
            one = true;
            continue;
        }
        all = false;
        if (s[i] == '2' || s[i] == '3' || s[i] == '4') {
            if (one) {
                cout << "No" << endl;
                return 0;
            }
            if (i > 0 && s[i - 1] > '0') {
                s[i - 1]--;
                continue;
            } else {
                cout << "No" << endl;
                return 0;
            }
        }
        cout << "No" << endl;
        return 0;
    }
    cout << (all ? "No" : "Yes") << endl;
}