Div. 64

Description:

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.

Sample Input:

100010001

Sample Output:

yes

Sample Input:

100

Sample Output:

no

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