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.


-----Examples-----
Input
100010001

Output
yes
Input
100

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

Difficulty: interview

Starter code:

Solutions:
s = input()
i = 0
while i < len(s) and s[i] == '0':
    i += 1
cnt = 0
while i < len(s):
    if s[i] == '0':
        cnt += 1
    i += 1

if cnt >= 6:
    print('yes')
else:
    print('no')


s=input()
one=False
zero=0
for x in s:
    if not one:
        if x=='1':
            one=True
    else:
        if x=='0':
            zero+=1
print('yes' if zero >= 6 else 'no')

number = input()

try:
    print('yes') if number[number.index('1') + 1:].count('0') >= 6 else print('no')
except ValueError:
    print('no')


s = input()
if '1' not in s:
    print('no')
else:
    i = s.index('1')
    ans = 0
    for j in range(i, len(s)):
        if s[j] == '0':
            ans += 1
    if ans >= 6:
        print('yes')
    else:
        print('no')


s = input()
if(s.count('1') > 0):
	i = s.index('1')
	s = s[i:]
	if(s.count('0') >= 6):
		print('yes')
	else:
		print('no')
else:
	print('no')

s = input()
s2 = '1000000'
p = 0
for i in s:
    if p >= len(s2):
        break
    if i == s2[p]:
        p+=1
if p >= len(s2):
    print('yes')
else:
    print('no')

s = input()
one = s.find('1')
if one == -1:
    print("no")
else:
    s = s[one:]
    zero = s.count('0')
    if zero >= 6:
        print("yes")
    else:
        print("no")


# Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!

s=input()

d=s.find('1')

if d!=-1 and s[d+1:].count('0')>=6:
	print("yes")
else:
	print("no")

s = input()
if s[s.find('1'):].count('0') >= 6:
    print('yes')
else:
    print('no')

instr = input()
firstone = instr.find("1")
if firstone == -1:
    print("no")
else:
    if instr[firstone+1:].count("0") >= 6:
        print("yes")
    else:
        print("no")


# -*- coding: utf-8 -*-

import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys

"""
created by shhuan at 2017/11/4 00:05

"""

S = input()

for i in range(len(S)):
    if S[i] == '1':
        if S[i:].count('0') >= 6:
            print('yes')
            return
print('no')


s = input()
if s[s.find('1'):].count('0') >= 6:
    print('yes')
else:
    print('no')

q=input()
if '1' in q:
    a=q.index('1')
    q=q[a:]
    if q.count('0')>=6:
        print('yes')
    else:
        print('no')
else:
    print('no')


a = input()

n = len(a)

for i in range( n ):
	if a[i] == '1':
		tot = 0
		for j in range( i+1, n ):
			if a[j] == '0':
				tot += 1
				if tot == 6:
					print( "yes" )
					return
					
print( "no" )

s = list(input())
for i in range(len(s)):
    if s[i] == '1' and s[i::].count('0') >= 6:
        print('yes')
        return

print('no')


s=input()
count=0
for i in range(len(s)):
  if(s[i]=='1'):
    for j in range(i+1,len(s)):
      if(s[j]=='0'):
        count+=1
    break
if(count>=6):
  print("yes")
else:
  print("no")

#!/bin/python3
# template

import sys
from collections import Counter



def read_ints(inp = sys.stdin):
    return list(map(int,next(inp).strip().split()))

def print_list(l):
    print(' '.join(map(str,l)))

def sol1(A):
    A = A.lstrip("0")
    cc= Counter(A)
    res = cc['0'] >=6
    return "yes" if res else "no"


def __starting_point():
    #T ,= read_ints()
    for i in range(1):
        A = next(sys.stdin).strip()
        print(sol1(A))

__starting_point()

s = str(input())
f = False
count = 0
for i in s:
    if f:
        if i == '0':
            count += 1
    else:
        if i == '1':
            f = True

if count >= 6:
    print("yes")
else:
    print("no")


s = input()

p = 0
r = 'no'
for d in reversed(s):
    if d == '0':
        p += 1
    elif p >= 6:
        r = 'yes'

print(r)


seq = input()
zCount = 0
hasLead = False
for i in range(1, len(seq)+1):
    if seq[-i] == '0':
        zCount += 1
    if zCount >= 6 and seq[-i] == '1':
        hasLead = True
if hasLead:
    print('yes')
else:
    print('no')


s = input()
k1 = 0
k0 = 0
for i in s:
    if i == '0':
        k0+=1
    else:
        break
s = s[k0:]  
k0 = 0
for i in s:
    if i == '0':
        k0+=1
    else:
        k1+= 1
if k1 >= 1 and k0 >= 6:
    print("yes")
else:
    print("no")

n = input()
if("1" in n):
    n = n[n.find("1"):]
    if(n.count("0") >= 6):
        print("yes")
    else:
        print("no")
else:
    print("no")