#include using namespace std; // #include // using namespace atcoder; #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= n; ++i) #define reps(i, s, e) for (ll i = s; i <= e; ++i) #define rrep(i, n) for (ll i = n - 1; 0 <= i; --i) #define all(v) v.begin(), v.end() #define endl "\n" template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } using ll = long long; using ld = long double; using cp = complex; using pa = pair; using tup = tuple; using vp = vector >; using vtup = vector >; using st = string; using vs = vector; using vc = vector; using vvi = vector >; using vvc = vector >; using vi = vector; const ll MOD1 = 1000000007; const ll MOD2 = 998244353; const ll INF = (1LL << 60); void init() { ios_base::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cout << fixed << setprecision(15); } int main() { init(); ll n; cin >> n; ll base = 0, cur = 0; while (n > 0) { if (n % 10) { base += pow(2, cur); } cur++; n /= 10; } if (__builtin_popcount(base) == 1) { cout << "No" << endl; } else if (__builtin_popcount(base) == 2) { cout << "Yes" << endl; } else { rep(i, cur - 1) { string s = to_string(n); rep(i, cur - 1) if (s[i] == '0' && s[i + 1] == '1') { cout << "No" << endl; return 0; } } cout << "Yes" << endl; } }