#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s; cin >> s;
    vector<pair<char,int>> v;
    int cnt = 0;
    int cnt2 = 0;
    for(char c:s){
        cnt += c-'0';
        if(v.size() and v.back().first == c){
            v.back().second++;
        }
        else{
            v.push_back({c,1});
        }
    }
    for(auto p:v){
        if(p.first == '1') cnt2++;
    }
    if(cnt == 2){
        cout << "Yes" << "\n";
    }
    else if(cnt > 2 and cnt2 == 1){
        cout << "Yes" << "\n";
    }
    else{
        cout << "No" << "\n";
    }
}