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.
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](https://en.wikipedia.org/wiki/Binary_system)
100010001
yes
100
no
0000001000000
yes
1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
no
1111111111111111111111111111111111111111111111111111111111111111111111110111111111111111111111111111
no
0111111101111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
no
1111011111111111111111111111110111110111111111111111111111011111111111111110111111111111111111111111
no
1111111111101111111111111111111111111011111111111111111111111101111011111101111111111101111111111111
yes
0110111111111111111111011111111110110111110111111111111111111111111111111111111110111111111111111111
yes
1100110001111011001101101000001110111110011110111110010100011000100101000010010111100000010001001101
yes
000000
no
0001000
no
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
no
1000000
yes
0
no
1
no
10000000000
yes
0000000000
no
0010000
no
000000011
no
000000000
no
00000000
no
000000000011
no
0000000
no
00000000011
no
000000001
no
000000000000000000000000000
no
0000001
no
00000001
no
00000000100
no
00000000000000000000
no
0000000000000000000
no
00001000
no
0000000000010
no
000000000010
no
000000000000010
no
0100000
no
00010000
no
00000000000000000
no
00000000000
no
000001000
no
000000000000
no
100000000000000
yes
000010000
no
00000100
no
0001100000
no
000000000000000000000000001
no
000000100
no
0000000000001111111111
no
00000010
no
0001110000
no
0000000000000000000000
no
000000010010
no
0000100
no
0000000001
no
000000111
no
0000000000000
no
000000000000000000
no
0000000000000000000000000
no
000000000000000
no
0010000000000100
yes
0000001000
no
00000000000000000001
no
100000000
yes
000000000001
no
0000011001
no
000
no
000000000000000000000
no
0000000000011
no
0000000000000000
no
00000000000000001
no
00000000000000
no
0000000000000000010
no
00000000000000000000000000000000000000000000000000000000
no
000011000
no
00000011
no
0000000000001100
no
00000
no
000000000000000000000000000111111111111111
no
000000010
no
00000000111
no
000000000000001
no
0000000000000011111111111111111
no
0000000010
no
0000000000000000000000000000000000000000000000000
no
00000000010
no
101000000000
yes
00100000
no
00000000000001
no
0000000000100
no
0000
no
00000000000111
no
0000000000000011
no
0000000000000000000000000000000000000000
no
0000000000000010
no
0010101010
no
0000000000000001
no
1010101
no

s = iter(input())
ans = 0

for c in s:
    if c == '1':
        for c1 in s:
            ans += 1

print("yes") if ans >= 7 else print("no")