#include<iomanip>
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<map>
#include<set>
#include<queue>
#include<algorithm>

using namespace std;

int nr, N, v[1009], h[1009];
char sir[1009];

int main()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

gets (sir + 1), N = strlen (sir + 1);
for (int i=1; i<=N; i+= 8)
{
    v[++nr] = (sir[i] == '1');
    if (sir[i] == '1')
    {
        int l = 0, j = i + 7;
        while (sir[j] == '0') l ++, j --;
        h[nr] = l;
    }
}
for (int i=1; i<=nr; i++)
    if (v[i] == 1)
    {
        int bun = 0;
        for (int j=i+1; j<=nr && j<=i+h[i]; j++)
            bun += (v[j] == 0);
        if (bun != h[i])
        {
            printf ("No\n");
            return 0;
        }
        if (i + h[i] < nr && v[i + h[i] + 1] == 0)
        {
            printf ("No\n");
            return 0;
        }
    }
printf ("Yes\n");

return 0;
}