#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstdio>
#include <iomanip>
#include <list>

#define PI 3.14159265358979323846
#define mod 1000000007
#define pow9 1000000000
#define INF (1 << 30)

using namespace std;


int main() {
	string n;
	cin >> n;

	int n_cnt = 0;
	bool flg = true;
	for (int i = 0; i < n.size(); i++) {
		if (n[i] == '1') {
			n_cnt++;
		}
		if (i - 1 >= 0 && n[i - 1] == '0' && n[i] == '1') {
			flg = false;
		}
	}

	if (n_cnt == 1) {
		cout << "No" << endl;
	}
	else if (n_cnt == 2 || flg) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}