#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
#define IO  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define req(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define fi first
#define se second
using namespace std; 
 
const int inf=0x3f3f3f3f;
typedef long long ll; 
const int N = 1e5+7;
const ll mod = 1e9+7;  
int a[N];
int main()
{
    IO;
    string s;
    cin>>s;
    if(s.size()==1){
    	cout<<((s[0]=='8')?"Yes":"No")<<endl;return 0;
    }
    if(s.size()==2){
    	if(((s[0]-'0')*10+(s[1]-'0'))%8==0||((s[0]-'0')+(s[1]-'0')*10)%8==0)cout<<"Yes"<<endl;
    	else cout<<"No"<<endl;
    	return 0;
    }
    for(char i:s)a[i-'0']++;
    rep(i,1,9){
    	if(!a[i])continue;
    	int k=(i*100+7)/8*8;
    	while(k<(i+1)*100){
    		int p=k;
    		if(k%10>0&&k/10%10>0){
    			if(a[p%10]>0){
    				int x=p%10;
    				p/=10;
    				a[x]--;
    				if(a[p%10]>0){
    					int y=p%10;
    					p/=10;
    					a[y]--;
    					if(a[p%10]>0){
    						cout<<"Yes"<<endl;
    						return 0;
    					}a[y]++;
    				}a[x]++;
    			}
    		}
    		k+=8;
    	}
    }
    cout<<"No"<<endl;
    return 0;
}
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <limits.h>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll MOD=1000000007;
ll INF=1000000011;
ll MOD2=998244353;
ll LINF = 1001002003004005006ll;
ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

string S;
ll A[10];

signed main(){
  cin >> S;
  rep(i,S.size()){
    A[ctoi(S[i])]++;
  }
  if(S.size()==2){
    string V=S;
    reverse(ALL(V));
    if(stoi(S)%8==0 || stoi(V)%8==0){
      cYes;return 0;
    }
  }
  else if(S.size()==1){
    if(stoi(S)%8==0){
      cYes;return 0;
    }
  }
  else{
    for(int i=0;i<1000;i+=8){
      vector<ll> B(10,0);
      ll K=i;
      rep(j,3){
        B[K%10]++;
        K/=10;
      }
      ll Z=1;
      rep(j,10){
        if(B[j]>A[j]){
          Z=0;
        }
      }
      if(Z){
        //cout << i << endl;
        cYes;return 0;
      }
    }
  }
  cNo;
}