import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
string P;

void main() {
  try {
    for (; ; ) {
      P = readToken();
      N = cast(int)(P.length);
      
      auto a = new int[N + 1];
      foreach (i; 0 .. N) {
        a[i] = P[N - 1 - i] - '0';
      }
      
      bool has2 = false, ok = true;
      int bef = 2, now;
      foreach (i; 0 .. N) {
        if (a[i] == 2 || a[i] == 3 || a[i] == 4) {
          if (a[i + 1] == 0) {
            ok = false;
            break;
          }
          --a[i + 1];
          has2 = true;
          now = 2;
        } else if (a[i] == 6 || a[i] == 7) {
          now = 1;
        } else if (a[i] == 0) {
          now = 0;
        } else {
          ok = false;
          break;
        }
        ok = ok && (bef >= now);
        bef = now;
      }
      const ans = (has2 && ok);
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}