#include<iostream>
#include <algorithm>
#include <functional>
#include<vector>
#include<math.h>
#include<bitset>
#include<string>
#include <deque>
#include<queue>
#include <iomanip>
#include<map>
#include <random>
#include<type_traits>
#include<stack>
#include <sstream> 
#include <limits>
#include <numeric>
#include<string.h>
#include<set>
using namespace std;
#define ll long long int
ll mod = 1000000007;
//typedef vector<int> V;
//typedef vector<V> VV;
//typedef vector<VV> VVV;

int main() {
	string s;
	int under_num = 0;
	cin >> s;
	for (int i = 0; i < s.length(); i++) {
		if (under_num == 0 && i != 0) {
			if (s[s.length() - i - 1] != '7' || s[s.length() - i - 1] != '6') {
				cout << "No" << endl;
				return 0;
			}
		}
		if (((s[s.length() - i - 1]-'0')-under_num== 3)|| ((s[s.length() - i - 1] - '0') - under_num == 4)|| ((s[s.length() - i - 1] - '0') - under_num == 2)) {
			under_num = 1;
		}
		else if(((s[s.length() - i - 1] - '0') - under_num == 7)|| ((s[s.length() - i - 1] - '0') - under_num == 6)){
			under_num = 0;
		}
		else if (!((s[s.length() - i - 1] - '0') - under_num == 0&&i==s.length()-1) ){
			cout << "No" << endl;
			return 0;
		}
	}

	if(under_num==0)cout << "Yes"<< endl;
	else cout << "No" << endl;
	return 0;
}