// Template v2
#define pb push_back
#define mp make_pair
#define first x
#define second y
#define l(x) x<<1
#define r(x) x<<1 | 1
#define lsb(x) x & -x
#include<bits/stdc++.h>
#include <bitset>
using namespace std;
 
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PKK;
// primes less than 100
const int PRIM[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
const int CMAX = 10005;
const int MOD = 700001;
const int NMAX = 1e5 + 69;
const short INF16 = 32000;
const int INF = 2*1e9 + 6661369;
const LL INF64 = LL(1e18);
const LD EPS = 1e-9, PI = acos(-1.0);
int k,must;
string s;
bool q=true;
void read()
{
    cin>>s;
    for(int i=0; i<s.size(); ++i)
    {
        if(s[i]=='0'){
            i+=7;
            must--;
        }
        else
        {
            if(must!=0)
                q=false;
            for(int j=0; j<8; ++j)
                if(s[i+j]=='0')
                    k++;
                else
                    k=0;
            must=k;
            //cout<<i<<" "<<must<<"\n";
            i+=7;
        }
    }
    if(must!=0)
        q=false;
    if(q)
        cout<<"Yes";
    else
        cout<<"No";
}
 
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    read();
     
    return 0;
}