#include <bits/stdc++.h>
using namespace std;
void fasto() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
int n;
string s;
int main() {
  fasto();
  cin >> s;
  bool f = false;
  pair<int, pair<int, int> > p;
  n = s.size();
  for (int i = 0; i < n; i++) {
    if (s[i] == '8' or s[i] == '0') {
      cout << "YES" << endl << s[i];
      return 0;
    }
  }
  if (n == 2) {
    int ans = (s[0] - '0') * 10 + (s[1] - '0');
    if (ans % 8 == 0) {
      cout << "YES" << endl << ans;
      return 0;
    }
    if ((s[0] - '0') % 8 == 0) {
      cout << "YES" << endl << s[0] - '0';
      return 0;
    }
    if ((s[1] - '0') % 8 == 0) {
      cout << "YES" << endl << s[1] - '0';
      return 0;
    }
    cout << "NO";
    return 0;
  }
  s = "0" + s;
  n++;
  for (int i = n - 1; i >= 2; i--) {
    if (f) break;
    for (int j = i - 1; j >= 1; j--) {
      if (f) break;
      for (int k = j - 1; k >= 0; k--) {
        int ans =
            int(s[k] - '0') * 100 + int(s[j] - '0') * 10 + int(s[i] - '0');
        if (ans % 8 == 0) {
          f = true;
          p = {i, {j, k}};
          break;
        }
      }
    }
  }
  if (f) {
    cout << "YES" << endl;
    for (int i = 1; i < p.second.second + 1; i++) cout << s[i];
    cout << s[p.second.first] << s[p.first];
  } else {
    for (int i = 1; i < n; i++)
      if (s[i] == '0') {
        cout << "YES" << endl << 0;
        return 0;
      }
    cout << "NO";
  }
  return 0;
}
