#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    string p;
    cin >> p;
    if (p[0] != '1') {
        if (p[0] == '6' || p[0] == '7') {
            int mode = 2;
            rep(i, 1, p.size() - 1) {
                int n = p[i] - '0';
                if (mode == 2) {
                    if (n == 8) {
                        mode = 1;
                    } else {
                        if (n == 7 || n == 6) {
                            continue;

                        } else if (n >= 3 && n <= 5) {
                            mode = 1;
                        } else {
                            cout << "No" << endl;
                            return 0;
                        }
                    }
                } else {
                    if (n < 3 || n > 5) {
                        cout << "No" << endl;
                        return 0;
                    }
                }
                int ln = p[p.size() - 1] - '0';
                if (ln < 2 || ln > 4) {
                    cout << "No" << endl;
                    return 0;
                }
            }
            cout << "Yes" << endl;
        } else if (p[0] == '8') {
            rep(i, 1, p.size() - 1) {
                int n = p[i] - '0';
                if (n < 3 || n > 5) {
                    cout << "No" << endl;
                    return 0;
                }
            }
            int ln = p[p.size() - 1] - '0';
            if (ln < 2 || ln > 4) {
                cout << "No" << endl;
                return 0;
            }
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
            return 0;
        }
    } else {
        rep(i, 1, p.size() - 1) {
            int n = p[i] - '0';
            if (n < 3 || n > 5) {
                cout << "No" << endl;
                return 0;
            }
        }
        int ln = p[p.size() - 1] - '0';
        if (ln < 2 || ln > 4) {
            cout << "No" << endl;
            return 0;
        }
        cout << "Yes" << endl;
    }


    return 0;
}