#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

vector<pair<char, long long>> encoded;

void encode(string &S){
    long long l = 0, r, N=S.size();
    while(l != N){
        r = l+1;
        while(r<N && S[l] == S[r]) r++;
        encoded.push_back(make_pair(S[l], r-l));
        l = r;
    }
}

int main(){

    ll N=0, M=0;
    string S;
    cin >> S;
    encode(S);
    for (auto [c, x] : encoded){
        if (c == '1'){
            M++;
            N += x;
        }
    }

    if ((M == 2 && N == 2) || (M == 1 && N >= 2)) cout << "Yes" << endl;
    else cout << "No" << endl;

    return 0;
}