MASRIII

#include <bits/stdc++.h>
/*
    HACK ME IF U CAN  M_F
*/
using namespace std;
typedef long long ll;
typedef long double ld;
const int MX=7+1e5;
string h;
string ans;
int f(int x,int y)
{
    int z=x%8;
    for(int i=0;i<y;i++)
        z*=10,z%=8;
    return z;
}
bool dp[103][2][8];
void solve(int x,bool fl,int md)
{
    if(fl)
    {
        if(md==0)
        {
              cout<<"YES"<<endl<<ans;
            exit(0);
        }
    }
    if(dp[x][fl][md])return;
    if(x==h.length())return;
    ans.push_back(h[x]);

    solve(x+1,1,(md*10%8+(h[x]-'0')%8)%8);
    ans.pop_back();
    solve(x+1,fl,md);
    dp[x][fl][md]=1;
}
int main()
{
    cin>>h;
    solve(0,0,0);
   cout<<"NO";
    return 0;
}