#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

bool solve(string p) {
	const int num[] = {0, 6, 7};
	int n = SZ(p);
	vector<bool> dp(8);
	dp[0] = true;
	reverse(ALL(p));
	REP(i, n) {
		DEBUG(i);
		vector<bool> next(8);
		REP(x, 3) {
			REP(y, 3) {
				REP(mask, 8) {
					if(!dp[mask]) continue;
					int sum = num[x]+num[y];
					DEBUG(sum);
					if(((mask&1) && x != 0) || (((mask>>1)&1) && y != 0)) {
						continue;
					}
					if((mask>>2)&1) {
						// DEBUG(mask);
						sum++;
					}
					if(sum%10 == p[i]-'0') {
						// DEBUG(mask);
						// DEBUG((mask>>2)&1);
						// DEBUG(x); DEBUG(y); DEBUG(sum);
						next[((sum>=10)<<2) | ((y==0)<<1) | (x==0)] = true;
					}
				}
			}
		}
		swap(dp, next);
		if(i == 0) {
			REP(mask, 8) {
				if(((mask>>1)&1) || (mask&1)) {
					dp[mask] = false;
				}
			}
		}
		dpite(ALL(dp));
	}
	bool ans = false;
	REP(i, 4) {
		if(dp[i]) {
			ans = true;
		}
	}
	return ans;
}

int naive(int a) {
	REP(m0, 1<<10) {
		REP(m1, 1<<10) {
			int mm0 = m0;
			int mm1 = m1;
			int x = 0;
			while(mm0 > 0) {
				x *= 10;
				if(mm0&1) {
					x += 6;
				} else {
					x += 7;
				}
				mm0 >>= 1;
			}
			int y = 0;
			while(mm1 > 10) {
				y *= 10;
				if(mm1&1) {
					y += 6;
				} else {
					y += y;
				}
				mm1 >>= 1;
			}
			if(x+y == a){
				DEBUG(x); DEBUG(y);
				return true;
			}
		}
	}
	return false;
}

//library
random_device rnd;
mt19937 MT(rnd());

int randInt(int from, int to) {
	uniform_int_distribution<int> rand(from, to - 1);
	return rand(MT);
}

long long randInt(long long from, long long to){
	uniform_int_distribution<long long> rand(from, to-1);
	return rand(MT);
}
//library


int main()
{
	ios_init();
	// while(true){
	// 	int p = randInt(0, 100);
	// 	if(naive(p) != solve(to_string(p))) {
	// 		cout << p << endl;
	// 		return 0;
	// 	}
	// }
	string p;
	while(cin >> p) {
		if(solve(p)) {
			cout << "Yes" << endl;
		} else {
			cout << "No" << endl;
		}
	}
	return 0;
}