#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; int main() { string p; cin >> p; if (p.length() == 1 || (p.back() != '2' && p.back() != '3' && p.back() != '4')) { cout << "No\n"; return 0; } if (p[0] == '1') { FOR(i, 1, p.size() - 1) { if (p[i] != '3' && p[i] != '4' && p[i] != '5') { cout << "No\n"; return 0; } } } else { int i = p.size() - 2; for (; i >= 0; --i) { if (p[i] != '3' && p[i] != '4' && p[i] != '5') break; } if (i == -1 || (p[i] != '7' && p[i] != '8')) { cout << "No\n"; return 0; } for (; --i >= 0; --i) { if (p[i] != '6' && p[i] != '7') { cout << "No\n"; return 0; } } } cout << "Yes\n"; return 0; }