Codeforces Round 444 (Div. 2)
A
Div. 64
Codeforces
1000
原题
←B →
翻译中…

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.

翻译中…

Input

翻译中…

In the only line given a non-empty binary string $*s*$ with length up to $100$.

翻译中…

Output

翻译中…

Print «yes» (without quotes) if it's possible to remove digits required way and «no» otherwise.

翻译中…

Note

翻译中…

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

翻译中…

样例

Input #1
100010001
Output #1
yes
InputCopy OutputCopy
Input #2
100
Output #2
no
InputCopy OutputCopy
题目信息
题号
887A
时间限制
1 s
内存限制
256 MB
标签
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。