CF887A.Div. 64
普及/提高-
通过率：0%
AC君温馨提醒
该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。
题目描述
Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.
Her problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.
输入格式
In the only line given a non-empty binary string s with length up to 100 .
输出格式
Print «yes» (without quotes) if it's possible to remove digits required way and «no» otherwise.
输入输出样例
输入#1
100010001
输出#1
yes
输入#2
100
输出#2
no
说明/提示
In the first test case, you can get string 1 000 000 after removing two ones which is a representation of number 64 in the binary numerical system.
You can read more about binary numeral system representation here: https://en.wikipedia.org/wiki/Binary_system