#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };

const ll MOD = 1000000007;
const ll INF = 100000;


ll n;
int main(void){
    string s;
    cin >> s;
    for (int i = 0; i < s.size(); i++){
        if (i == 0){
            if (s[i] != '1'){
                cout << "No" << endl;
                return 0;
            }
        }
        else if (i == s.size() - 1){
            if (s[i] != '2' && s[i] != '3' && s[i] != '4'){
                cout << "No" << endl;
                return 0;
            }
        }
        else{
            if (s[i] != '3' && s[i] != '4'&& s[i] != '5'){
                cout << "No" << endl;
                return 0;
            }
        }
    }

    cout << "Yes" << endl;
      
}