#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

//typedef pair<int,int> P;



int main(){
	char p[20000+1];

	scanf("%s", p);
	reverse(p,p+strlen(p));

	int carry = 0;
	for(int i=0;i<strlen(p)-1;i++){
		if((carry+6+6)%10 == p[i]-'0') carry = 1;
		else if((carry+6+7)%10 == p[i]-'0') carry = 1;
		else if((carry+7+7)%10 == p[i]-'0') carry = 1;
		else if((carry+6)%10 == p[i]-'0') carry = 0;
		else if((carry+7)%10 == p[i]-'0') carry = 0;
		else{
			printf("No\n");
			return 0;
		}
	}

	if(carry==p[strlen(p)-1]-'0'){
		printf("Yes\n");
	}else if(carry+6==p[strlen(p)-1]-'0'){
		printf("Yes\n");
	}else if(carry+7==p[strlen(p)-1]-'0'){
		printf("Yes\n");
	}else{
		printf("No\n");
	}

	return 0;
}