#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b) return a;
  return b;
}
long long int min(long long int a, long long int b) {
  if (a < b) return a;
  return b;
}
long long int power(long long int n, long long int k) {
  if (k == 0) return 1;
  if (k == 1) return n;
  long long int res = power(n, k / 2);
  if (k % 2 == 0) return res * res;
  return res * res * n;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  int dp[n][8][2];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < 8; j++) dp[i][j][0] = dp[i][j][1] = 0;
  dp[0][(s[0] - '0') % 8][1] = 1;
  for (int i = 1; i < n; i++) {
    int k = s[i] - '0';
    dp[i][k % 8][1] = 1;
    for (int j = 0; j < 8; j++) {
      if (dp[i - 1][j][0] == 1 || dp[i - 1][j][1] == 1) {
        dp[i][j][0] = 1;
        dp[i][(j * 10 + k) % 8][1] = 1;
      }
    }
  }
  int idx = -1;
  int jdx = -1;
  for (int i = 0; i < n; i++) {
    if (dp[i][0][1] == 1) {
      idx = i;
      jdx = 0;
      break;
    }
  }
  if (idx == -1) {
    cout << "NO" << endl;
    return 0;
  }
  string res = "";
  while (idx >= 0) {
    if (dp[idx][jdx][0] == 0 && dp[idx][jdx][1] == 0) break;
    if (dp[idx][jdx][1] == 1) {
      res = s[idx] + res;
      int k = s[idx] - '0';
      idx--;
      bool f = true;
      for (int i = 0; i < 8; i++) {
        if ((i * 10 + k) % 8 == jdx &&
            (dp[idx][i][0] == 1 || dp[idx][i][1] == 1)) {
          jdx = i;
          f = false;
          break;
        }
      }
      if (f == true) break;
      continue;
    }
    idx--;
    continue;
  }
  cout << "YES" << endl;
  cout << res;
  return 0;
}
