#include <cstdio> #include <cstring> #include <iostream> #include <string> #include <cmath> #include <bitset> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> using namespace std; typedef long long int ll; typedef pair<int, int> P; int main() { string p; cin>>p; int n=p.size(); if(n==1){ cout<<"No"<<endl; return 0; } int a0=p[n-1]-'0'; if(a0<2 || a0>4){ cout<<"No"<<endl; return 0; } for(int i=n-1; i>=1; i--){ int a=p[i]-'0'; if(a<2 || a>4){ for(int j=i; j>=0; j--){ if(p[j]!='6' && p[j]!='7'){ cout<<"No"<<endl; return 0; } } cout<<"Yes"<<endl; return 0; }else{ if(p[i-1]=='0'){ cout<<"No"<<endl; return 0; }else{ p[i-1]--; } } } if(p[0]=='0' || p[0]=='6' || p[0]=='7') cout<<"Yes"<<endl; else cout<<"No"<<endl; return 0; }