#include <bits/stdc++.h>
using namespace std;
const long long inf = 9.2e18;
const int maxn = 2e5 + 70;
const int INF = 2.1e9;
const int maxm = 1e6 + 70;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);
int n, m, k;
int a[maxn];
int main() {
  string s;
  while (cin >> s) {
    int cnt = 0;
    for (int i = 0; i < s.length(); i++) {
      if (s[i] == '1') {
        for (int j = i + 1; j < s.length(); j++)
          if (s[j] == '0') cnt++;
        break;
      }
    }
    if (cnt >= 6)
      cout << "yes" << endl;
    else
      cout << "no" << endl;
  }
  return 0;
}
