#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <random>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)

template<class T>
using vi = vector<T>;

template<class T>
using vii = vector<vi<T>>;

template<class T>
using viii = vector<vii<T>>;

int main()
{
    string s;
    cin >> s;
    int n = s.size();
    int cnt = 0;
    rep(i, n) if (s[i] == '1') cnt++;
    if (cnt == 2) {
        cout << "Yes" << endl;
        return 0;
    }
    else if (cnt == 1) {
        cout << "No" << endl;
        return 0;
    }

    int cnt2 = 0;
    rep(i, n) {
        if (s[i] == '0') {
            if (cnt == cnt2) cout << "Yes" << endl;
            else cout << "No" << endl;
            return 0;
        }
        cnt2++;
    }
    cout << "Yes" << endl;
    return 0;
}