#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 3;
char s[MAXN];
int N, suff[MAXN];
int main() {
  scanf("%s", s);
  N = (int)strlen(s);
  suff[N] = 0;
  for (int i = N - 1; ~i; --i) {
    suff[i] = suff[i + 1];
    if (s[i] == '0') ++suff[i];
  }
  int flag = 0;
  for (int i = 0; i < N && !flag; ++i)
    if (s[i] == '1' && suff[i] >= 6) flag = 1;
  puts(flag ? "yes" : "no");
  return 0;
}
