#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
using namespace std;


const int N = 1e4+ 5;
char s[N];

int main()
{
    scanf("%s", s);
    int n = strlen(s);
    int cars = -1;
    for(int i = 0; i < n; i += 8) {
        int i1 = i + 7;
        if(s[i] == '0') {
            if(cars == -1)
                continue;
            if(cars == 0) {
                cout << "No" << endl;
                return 0;
            }
            cars--;
        }
        else {
            if(cars > 0) {
                cout << "No" << endl;
                return 0;
            }
            cars = 0;
            for(int j = i1; j > i; --j) {
                if(s[j] == '0')
                    cars++;
                else
                    break;
            }
        }
    }
    if(cars > 0)
        cout << "No" << endl;
    else
        cout << "Yes" << endl;
    
    return 0;
}