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: EASY

Solutions:
import sys
b = False
c = False
count = 0
str = sys.stdin.read()
for char in str:
	if char == '1':
		b = True
	if b and char == '0':
		count += 1
	if count >= 6:
		print('yes')
		c = True
		break
if not c:
	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')


def list_input():
	return list(map(int, input().split()))
s = input()
n = len(s)
flag = False
cnt = 0
for i in range(n):
	if s[i] == '1':
		flag = True
	if flag and s[i] == '0':
		cnt += 1
if flag and cnt >= 6:
	print('yes')
else:
	print('no')


import sys
s = input()[::-1]
k = 0
for i in s:
	if i == '0':
		k = k + 1
	elif k >= 6 and i == '1':
		print('yes')
		sys.exit()
print('no')


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


s = input()
target = '1000000'
i = 0
j = 0
while i < len(s) and j < len(target):
	if s[i] == target[j]:
		j += 1
	i += 1
print(['no', 'yes'][j == len(target)])


a = input()
sz = len(a)
flg = 0
cnt = 0
for i in range(0, sz):
	k = a[i]
	if int(k) == 1:
		flg = 1
		continue
	if flg == 1 and int(k) == 0:
		cnt += 1
if cnt >= 6:
	print('yes')
else:
	print('no')


def to_64(b):
	n = b.find('1')
	if n == -1:
		return False
	return b[n:].count('0') >= 6
print('yes' if to_64(input()) else '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')


def solve():
	while 1:
		s = list(input())
		if len(s) < 7 or s.count('1') == 0:
			print('no')
			break
		i = 0
		while 1:
			if s[i] == '1':
				start = i
				break
			else:
				i += 1
		if s[start:].count('0') >= 6:
			print('yes')
		else:
			print('no')
		break
solve()


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()
has1 = False
kol = 0
for i in s:
	if has1:
		if i == '0':
			kol += 1
	elif i == '1':
		has1 = True
if kol >= 6:
	print('yes')
else:
	print('no')


s = input()
s = s[::-1]
count = 0
status = False
for i in s:
	if count < 6:
		if i == '0':
			count = count + 1
	elif i == '1':
		status = True
if count == 6 and status == True:
	print('yes')
else:
	print('no')


def isSubSequence(str1, str2, m, n):
	j = 0
	i = 0
	while j < m and i < n:
		if str1[j] == str2[i]:
			j = j + 1
		i = i + 1
	return j == m
s = input()
c1 = 0
c0 = 0
for each in s:
	if each == '0':
		c0 += 1
	else:
		c1 += 1
if c0 >= 6 and c1 >= 1:
	t = '1000000'
	if isSubSequence(t, s, len(t), len(s)):
		print('yes')
	else:
		print('no')
else:
	print('no')


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


n = int(input())
n = str(n)
a = list(n)
k = 0
a.reverse()
for i in range(len(a) - 1):
	if a[i] == '0':
		k += 1
		if k == 6:
			print('yes')
	elif a[i] == 1:
		a.remove(a[i])
v = 0
for i in range(len(a) - 1):
	if a[i] == '0':
		v += 1
if v < 6:
	print('no')


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


def cross_it_out(number):
	if number != '0b1':
		l = list(number)
		index = number.rfind('1')
		l[index] = ''
		return ''.join(l)
	return '0b0'

def is_valid(a):
	a = int(a, 2)
	while True:
		if a % 64 == 0 and a != 0:
			return 'yes'
		if a == 0:
			return 'no'
		a = int(cross_it_out(str(bin(a))), 2)
print(is_valid(input()))


import sys
s = input()
if s.count('0') == len(s):
	print('no')
	sys.exit()
while s[0] == '0':
	s = s[1:]
if s.count('0') > 5:
	print('yes')
else:
	print('no')


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


s = input()
ans = 'no'
if '1' in s:
	c = 0
	for i in range(s.index('1') + 1, len(s)):
		if s[i] == '0':
			c += 1
			if c > 5:
				ans = 'yes'
				break
print(ans)


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


print('yes' if input().partition('1')[2].count('0') >= 6 else 'no')


s = input().strip()
if len(s) <= 6:
	print('no')
else:
	flag = 0
	for i in range(len(s)):
		if s[i] == '1':
			c = 0
			for j in range(i + 1, len(s)):
				if s[j] == '0':
					c += 1
					if c >= 6:
						flag = 1
						break
		if flag == 1:
			break
	if flag == 1:
		print('yes')
	else:
		print('no')


s = input()
cnt = 0
i = 0
s = s[::-1]
while cnt < 6 and i < len(s):
	if s[i] == '0':
		cnt += 1
	i += 1
if s.find('1', i) != -1 and cnt >= 6:
	print('yes')
else:
	print('no')


s = input()
count = 0
store = 0
for i in range(-1, -len(s), -1):
	if s[i] == '0':
		count += 1
	if count == 6:
		store = i
		break
if abs(store) == len(s) or store == 0:
	print('no')
elif '1' in s[store::-1]:
	print('yes')
else:
	print('no')


s = str(input())
e = s.find('1')
f = s[e:]
if s.count('0') >= 6 and s.count('1') >= 1 and (f.count('0') >= 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')


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')


x = input()
print('yes' if x.count('0', x.find('1')) > 5 else 'no')


t = input()
if '1' in t:
	k = t.index('1')
else:
	print('no')
	exit()
t = t[k:]
r = t.count('0')
if r >= 6:
	print('yes')
else:
	print('no')


s = input().strip().lstrip('0')
if s.count('0') >= 6:
	print('yes')
else:
	print('no')


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


import sys
k = input()
n = k
count = 0
countz = 0
bool = False
for i in range(len(k)):
	if k[i] == '1':
		count += 1
	if count == 0:
		countz += 1
if len(k) - countz - count >= 6:
	print('yes')
else:
	print('no')


s = list(input())
sz = len(s)
c = 0
q = 0
for i in range(sz):
	if int(s[i]) == 1:
		f = i
		q = 1
		break
if q == 1:
	for i in range(f, sz):
		if int(s[i]) == 0:
			c += 1
if c >= 6:
	print('yes')
else:
	print('no')


n = input()
if int(n) >= 1000000 and str(int(n)).count('0') >= 6:
	print('yes')
else:
	print('no')


s = str(input())
f = False
count = 0
for i in s:
	if f:
		if i == '0':
			count += 1
	elif i == '1':
		f = True
if count >= 6:
	print('yes')
else:
	print('no')


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


a = list(reversed(input()))
flag = False
cnt = 0
for n in a:
	if n == '0':
		cnt = cnt + 1
	if cnt > 5 and n == '1':
		flag = True
if flag:
	print('yes')
else:
	print('no')


a = input()
for i in range(len(a)):
	if a[i] == '1' and a[i:].count('0') > 5:
		exit(print('yes'))
print('no')


class CodeforcesTask887ASolution:

	def __init__(self):
		self.result = ''
		self.number = ''

	def read_input(self):
		self.number = input()

	def process_task(self):
		if '1' in self.number:
			if self.number.split('1', 1)[1].count('0') >= 6:
				self.result = 'yes'
			else:
				self.result = 'no'
		else:
			self.result = 'no'

	def get_result(self):
		return self.result
Solution = CodeforcesTask887ASolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())


s = input()
cnt = 0
c = False
code = {'0': 1, '1': 0}
for t in s:
	if t == '1':
		c = True
	if c:
		cnt += code[t]
if cnt < 6:
	print('no')
else:
	print('yes')


s = input()
f = 0
x = '0'
for i in s:
	if i == '1':
		f = 1
		continue
	if f == 1 and i == '0':
		x += i
if len(x) > 6:
	print('yes')
else:
	print('no')


ch = str(input())
if len(ch) < 7 or ch.count('1') == 0:
	print('no')
else:
	while ch.index('1') != 0:
		ch = ch[1:]
	if ch.count('0') > 5:
		print('yes')
	else:
		print('no')


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


def can_rm(b):
	i = len(b) - 1
	z = 0
	while z < 6:
		if i < 0:
			return False
		if b[i] == '0':
			z += 1
		i -= 1
	while i >= 0:
		if b[i] == '1':
			return True
		i -= 1
	return False
b = input()
print('yes' if can_rm(b) else 'no')


s = input()
if len(s) < 7:
	print('no')
else:
	el = s.find('1')
	ending = s[el:]
	if ending.count('0') < 6:
		print('no')
	else:
		print('yes')


s = input()
d = 0
num_zero = 0
for c in s[::-1]:
	if c == '0':
		num_zero += 1
	else:
		d += 1
	if num_zero == 6:
		break
if num_zero == 6 and s.count('1') - d > 0:
	print('yes')
else:
	print('no')


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


str = input()
if str.count('0', str.find('1')) >= 6:
	print('yes')
else:
	print('no')


import re
print({True: 'yes', False: 'no'}[re.match('^.*1.*0.*0.*0.*0.*0.*0.*$', input()) is not None])


s = input()
x = len(s)
num = -1
for c in s[:]:
	if num < 0 and c == '1':
		num += 1
	elif num >= 0 and c == '0':
		num += 1
if num >= 6:
	print('yes')
else:
	print('no')


n = input()
if len(n) < 7:
	print('no')
else:
	count = 0
	startcount = False
	for i in n:
		if i == '1':
			startcount = True
		if i == '0' and startcount:
			count += 1
		if count == 6:
			print('yes')
			break
	if count != 6:
		print('no')


cislo = input()
pocetnul = 0
jednicka = False
for i in range(0, len(cislo), 1):
	if cislo[i] == '1':
		jednicka = True
	if jednicka == True:
		if cislo[i] == '0':
			pocetnul += 1
		if pocetnul == 6:
			print('yes')
			break
if pocetnul != 6:
	print('no')


print('yes' if input().lstrip('0').count('0') >= 6 else 'no')


s = input()
c = 0
j = s.find('1')
if j != -1:
	for i in range(j + 1, len(s)):
		if s[i] == '0':
			c += 1
		if c == 6:
			print('yes')
			exit(0)
print('no')


n = input()
pos = -1
cnt_null = 0
isFirst = True
for i in range(len(n)):
	if n[i] == '1':
		if isFirst:
			pos = i
			isFirst = False
	elif not isFirst:
		cnt_null += 1
if pos >= 0 and cnt_null >= 6:
	print('yes')
else:
	print('no')


import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
S = input()
for i in range(len(S)):
	if S[i] == '1':
		if S[i:].count('0') >= 6:
			print('yes')
			return
print('no')


s = str(input())
m = len(s)
buf_ind = 0
f = 0
count = 0
for i in range(0, m):
	if s[i] == '1':
		f = 1
		buf_ind = i + 1
		break
for i in range(buf_ind, m):
	if s[i] == '0':
		count += 1
if count >= 6 and f:
	print('yes')
else:
	print('no')


n = input()
flag1 = False
count = 0
for letter in n:
	if letter == '1' and flag1 == False:
		flag1 = True
	if flag1 == True and letter == '0':
		count += 1
if count >= 6:
	print('yes')
else:
	print('no')


import sys
s = input()
if len(s) < 7:
	print('no')
	sys.exit()
f = cnt = 0
for c in s:
	if c == '1':
		f = 1
	if f and c == '0':
		cnt += 1
if cnt >= 6:
	print('yes')
else:
	print('no')


def main():
	solver(input())

def solver(s):
	firstone = s.find('1')
	if firstone != -1 and s[firstone:].count('0') >= 6:
		print('yes')
	else:
		print('no')
main()


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():
	for i in range(1):
		A = next(sys.stdin).strip()
		print(sol1(A))
__starting_point()


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


n = str(int(input()))[::-1]
a = 0
for i in n:
	if i == '0':
		a += 1
if a >= 6:
	print('yes')
else:
	print('no')


x = input()
e = '0'
ce = 0
for i in reversed(range(len(x))):
	if x[i] == e:
		ce += 1
	if ce == 6 and e == '0':
		e = '1'
		ce = 0
	if ce == 1 and e == '1':
		print('yes')
		exit(0)
print('no')


a = list(str(input()))
b = len(a)
x = 0
if '1' in a:
	for i in range(a.index('1'), b):
		if a[i] == '0':
			x += 1
if x >= 6:
	print('yes')
else:
	print('no')


a = list(map(int, list(input())))
a = a[::-1]
if 1 in a:
	while a.index(1) < 6:
		a.remove(1)
		if not 1 in a:
			break
if 1 in a:
	print('yes')
else:
	print('no')


string = str(input())

def div64(string):
	zeros = 0
	for i in string[::-1]:
		if zeros >= 6 and i == '1':
			return 'yes'
		if i == '0':
			zeros += 1
	return 'no'
print(div64(string))


n = input()
n = str(int(n))
count = 0
for x in n:
	if x == '0':
		count += 1
if count >= 6:
	print('yes')
else:
	print('no')


s = str(input())
l = len(s)
f = 0
g = 0
x = 0
y = 0
for i in range(len(s) - 1, -1, -1):
	if int(s[i]) == 0:
		x = x + 1
		if x == 6:
			y = i
			g = 1
			break
for i in range(y):
	if int(s[i]) == 1:
		f = 1
		break
if f == 1 and g == 1:
	print('yes')
else:
	print('no')


s = input()
print('yes' if '1' in s and s.count('0') - s.index('1') >= 6 else 'no')


num = int(input())
cnt = 0
for i in str(num):
	if i == '0':
		cnt += 1
if num > 0 and cnt >= 6:
	print('yes')
else:
	print('no')


s = input()
try:
	print(['no', 'yes'][int(s[s.index('1'):].count('0') >= 6)])
except:
	print('no')


s = input()
ko = 0
kek = 0
d = ''
for i in range(len(s)):
	if s[i] == '1' and kek == 0 or kek == 1:
		kek = 1
		d += s[i]
for i in range(len(d)):
	if d[i] == '0':
		ko += 1
if ko >= 6:
	print('yes')
else:
	print('no')


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


name = input()
l = len(name)
count = 0
i = l - 1
while i >= 0:
	if name[i] == '1':
		count = count + 1
		if l - i - count >= 6:
			break
	i = i - 1
if i < 0:
	print('no')
else:
	print('yes')


s = input()
try:
	s.index('1')
except ValueError:
	print('no')
else:
	print('yes' if s[s.index('1'):].count('0') > 5 and s.count('1') > 0 else 'no')


s = input()
l = 0
for i in range(len(s) - 1, -1, -1):
	if l < 6:
		if s[i] == '0':
			l += 1
	elif s[i] == '1':
		l += 1
		break
if l == 7:
	print('yes')
else:
	print('no')


s = list(map(int, input()))
s = list(s)
for i in range(len(s)):
	if len(s) - i >= 7 and s[i] == 1 and (s[i:len(s)].count(0) >= 6):
		print('yes')
		break
else:
	print('no')


s = input()
l = len(s)
ans = 'no'
c = 0
i = l - 1
while i >= 0 and c < 6:
	if s[i] == '0':
		c += 1
	i -= 1
if c == 6:
	while i >= 0:
		if s[i] == '1':
			ans = 'yes'
		i -= 1
print(ans)


s = list(input())
f = True
for i in range(len(s)):
	if s[i] == '1':
		s = s[i:len(s)]
		if s.count('0') >= 6:
			print('yes')
			f = False
		break
if f:
	print('no')


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


text = input()

def f(text):
	for x in range(len(text)):
		if text[x] == '1':
			count = 0
			for y in range(x, len(text)):
				if text[y] == '0':
					count += 1
			if count >= 6:
				return True
	return False
print('yes') if f(text) else print('no')


n = list(input())
if '1' not in n:
	print('no')
else:
	z = n.index('1')
	if n[z:].count('0') >= 6:
		print('yes')
	else:
		print('no')


a = input()
t = False
c = 0
v = False
for i in range(len(a)):
	if t:
		if a[i] == '0':
			c += 1
	elif a[i] == '1':
		t = True
	if c >= 6:
		v = True
		break
if v:
	print('yes')
else:
	print('no')


s = iter(input())
ans = 0
for c in s:
	if c == '1':
		for c1 in s:
			if c1 == '0':
				ans += 1
print('yes') if ans >= 6 else print('no')


s = input()
n = len(s)
if '1' not in s:
	print('no')
else:
	ka = 0
	for i in range(n):
		if s[i] == '1':
			ka = i
			break
	l = s[ka:].count('0')
	if l >= 6:
		print('yes')
	else:
		print('no')


import sys
import math
import itertools
import collections

def getdict(n):
	d = {}
	if type(n) is list or type(n) is str:
		for i in n:
			if i in d:
				d[i] += 1
			else:
				d[i] = 1
	else:
		for i in range(n):
			t = ii()
			if t in d:
				d[t] += 1
			else:
				d[t] = 1
	return d

def divs(n, start=1):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def cdiv(n, k):
	return n // k + (n % k != 0)

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(map(int, input().split()))

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def wr(arr):
	return ''.join(map(str, arr))

def revn(n):
	return int(str(n)[::-1])

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base=3):
	newnumber = ''
	while number > 0:
		newnumber = str(number % base) + newnumber
		number //= base
	return newnumber
s = input()
print('yes') if s[s.find('1'):].count('0') >= 6 else print('no')


a = input()
s = 6
ind = 0
fl = False
for i in range(len(a)):
	if a[i] == '1':
		ind = i
		fl = True
		break
if fl == True:
	for i in range(ind, len(a)):
		if s == 0:
			break
		elif a[i] == '0':
			s -= 1
	if s == 0:
		print('yes')
	else:
		print('no')
else:
	print('no')


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


s = input()
if len(s) < 7 or s.find('1') == -1:
	print('no')
elif s.find('1') <= len(s) - 7:
	if s[s.find('1'):].count('0') >= 6:
		print('yes')
	else:
		print('no')
else:
	print('no')


import sys
str = input()
if str.find('1') == -1:
	print('no')
	sys.exit(0)
str = str[str.find('1'):].replace('1', '')
print('yes' if len(str) >= 6 else 'no')


n = list(input())
m = len(n)
e = 0
s = 1
if n.count('1') == 0:
	s = 0
for i in range(0, m):
	if n[i] == '1':
		e = i
		break
k = n[e:]
if s == 1:
	if k.count('0') >= 6:
		print('yes')
	else:
		print('no')
else:
	print('no')


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


def main():
	a = input()
	if a.count('1') < 1:
		return 'no'
	while a[0] == '0':
		a = a[1:]
	if a.count('0') > 5:
		return 'yes'
	return 'no'
print(main())


s = input()
h = 0
c = 0
for i in range(len(s)):
	if s[i] == '1':
		h = 1
	elif h == 1:
		c = c + 1
		if c == 6:
			break
if c == 6:
	print('yes', end='')
else:
	print('no', end='')


n = int(input())
n = str(n)
k = list(n)
if k.count('0') >= 6:
	print('yes')
else:
	print('no')


a = str(input())
b = str()
c = int(0)
d = int(0)
for b in a:
	if b == '0' and d > 0:
		c = c + 1
	if b == '1':
		d = d + 1
if c > 5:
	print('yes')
else:
	print('no')


n = str(input())
t = 0
a = 0
for i in range(len(n) - 1, -1, -1):
	if n[i] == '0':
		t += 1
		if t == 6:
			a = i
			break
if t < 6:
	print('no')
elif '1' in n[0:a]:
	print('yes')
else:
	print('no')


a = str(input())
b = a.find('1')
c = a.count('0', b, len(a))
if c >= 6:
	print('yes')
else:
	print('no')


a = input()
k = 0
n = 0
for i in range(len(a)):
	if a[i] == '1':
		k = 1
	if a[i] == '0' and k == 1:
		n = n + 1
if n >= 6:
	print('yes')
else:
	print('no')


s = input()
while len(s) > 0 and s[0] == '0':
	s = s[1:]
if len(s) > 0:
	while len(s) > 0 and s.find('1') != -1:
		s = s.replace('1', '')
	if len(s) >= 6:
		print('yes')
	else:
		print('no')
else:
	print('no')


print(['no', 'yes'][input().lstrip('0').count('0') >= 6])


str = input()
cnt = 0
flag = 0
for i in str:
	if flag == 1:
		if i == '0':
			cnt += 1
	elif i == '1':
		flag = 1
if cnt > 5:
	print('yes')
else:
	print('no')


s = input()
print('yes' if s.count('0', s.find('1')) > 5 else 'no')


n = input()
n = str(n)
if ('1' in n) == False:
	print('no')
else:
	j = 0
	i = n.index('1')
	while i < len(n):
		if n[i] == '0':
			j += 1
			i += 1
		else:
			i += 1
	if j >= 6:
		print('yes')
	else:
		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')


n = input()
A = n.split('1')
if len(A) >= 1:
	sz = 0
	for j in A[1:]:
		sz += len(j)
	if sz >= 6:
		print('yes')
	else:
		print('no')
else:
	print('no')


from sys import stdin
bin_str = stdin.readline().strip()
if len(bin_str) < 7:
	print('no')
	exit()
for i in range(len(bin_str) - 1, -1, -1):
	if bin_str[i] == '1' and bin_str[i:].count('0') >= 6:
		print('yes')
		exit()
print('no')


a = input()
i = a.find('1')
if i != -1:
	a = a[i:]
else:
	a = '1'

def count(B):
	count0 = 0
	count1 = 0
	for y in B:
		if y == '0':
			count0 += 1
		else:
			count1 += 1
	return (count0, count1)
(counta0, counta1) = count(a)
bt = bin(64)
b = bt[2:]
(countb0, countb1) = count(b)
if counta0 >= countb0 and counta1 >= countb1 and (int(a, 2) >= 64):
	print('yes')
else:
	print('no')


s = input()
com = 0
l = []
for i in s:
	l.append(i)
i = 0
while l[i] != '1' and i < len(l) - 1:
	l[i] = '1'
	i += 1
for i in l:
	if i == '0':
		com += 1
if com >= 6:
	print('yes')
else:
	print('no')


s = input()
p = 0
if '1' in s:
	pos = s.index('1')
	if len(s) - pos <= 6:
		print('no')
	else:
		for j in range(pos + 1, len(s)):
			if s[j] == '0':
				p += 1
		if p < 6:
			print('no')
		else:
			print('yes')
else:
	print('no')


import itertools
import re
import math
import getpass
import sys
debug = False
files = True
if getpass.getuser() == 'frohe':
	debug = True
if debug and files:
	sys.stdin = open('test.in')

def ria():
	return [int(i) for i in input().split()]
st = input()
on = st.find('1')
if on == -1:
	print('no')
	exit(0)
st = st[on:]
if st.count('0') >= 6:
	print('yes')
else:
	print('no')


s = '0' + input()
cnt = len(s) - 1
ziro = 0
bul = 0
while cnt != -1:
	if ziro >= 6 and s[cnt] == '1':
		print('yes')
		bul = 1
		break
	if s[cnt] == '0':
		ziro = ziro + 1
	cnt = cnt - 1
if bul == 0:
	print('no')


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


ch = input()
(a, b) = (0, 0)
for i in ch:
	if i == '1':
		a = 1
	if a and i == '0':
		b += 1
if b - 5 > 0:
	print('yes')
else:
	print('no')


s = input()
c = 0
for i in range(len(s) - 1, -1, -1):
	if s[i] == '0':
		c += 1
	if c > 5 and s[i] == '1':
		print('yes')
		break
	elif i == 0:
		print('no')


a = int(input())
s = 0
for i in range(1, len(str(a))):
	if str(a)[i] == '0':
		s += 1
if str(a)[0] == '1' and 10 ** s >= 1000000:
	print('yes')
else:
	print('no')


import sys
s = input()
a = list(s[::-1])
c = ['0', '0', '0', '0', '0', '0']
while len(a) >= 7 and '1' in a:
	if a[:6] == c:
		print('yes')
		sys.exit()
	a.remove('1')
print('no')


st = input()
x = list(bin(int(st, 2))[2:])
if x.count('0') > 5 and st.count('1') > 0:
	print('yes')
else:
	print('no')


a = list(str(int(input())))
if a.count('1') >= 1 and a.count('0') >= 6:
	print('yes')
else:
	print('no')


s = input()
n = len(s)
if '1' not in s:
	print('no')
else:
	for i in range(n):
		if s[i] == '1':
			s = s[i:]
			break
	n = len(s)
	tp = s.count('1') - 1
	if n - tp < 7:
		print('no')
	else:
		print('yes')


n = input()
i = 0
sum = 0
l = len(n)
while n[i] == '0':
	if i == l - 1:
		break
	i += 1
while i < l:
	if n[i] == '0':
		sum += 1
	i += 1
if sum < 6:
	print('no')
else:
	print('yes')


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


__author__ = 'Matias'

def onkoBinaari(inp):
	valid = True
	count = 0
	for a in inp:
		if a == '0' or a == '1':
			count += 1
		else:
			valid = False
			break
	return [valid, count]

def onko1ja6nollaa(inp):
	onefound = 0
	countToSix = 0
	for a in inp:
		if a == '1':
			onefound = 1
		if a == '0' and onefound == 1:
			countToSix += 1
		if countToSix > 5:
			return True
			break
	return False
inp = input('')
(valid, count) = onkoBinaari(inp)
if valid:
	if count > 6:
		ans = onko1ja6nollaa(inp)
		if ans:
			print('yes')
		else:
			print('no')
	else:
		print('no')
else:
	print('no')


s = input()
zcount = 0
for x in reversed(s):
	if x == '0':
		zcount += 1
	if zcount >= 6 and x == '1':
		print('yes')
		exit(0)
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)


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


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


s = input()
a = s.find('1')
c = 0
for x in s[a:]:
	if x == '0':
		c += 1
if c > 5:
	print('yes')
else:
	print('no')


a = input()
flag = False
num0 = 0
for i in range(0, len(a)):
	if a[i] == '1':
		flag = True
	if flag == True and a[i] == '0':
		num0 = num0 + 1
if num0 >= 6:
	print('yes')
else:
	print('no')


s = input()
while len(s) and s[0] == '0':
	s = s[1:]
print(['no', 'yes'][s.count('0') > 5])


a = int(input())
a_str = str(a)
numbers = {1: a_str.count('1'), 0: a_str.count('0')}
if numbers[1] > 0 and numbers[0] > 5:
	print('yes')
else:
	print('no')


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


s = input()
n = len(s)
if n < 7:
	print('no')
else:
	ct0 = 0
	i = n
	while i > 0:
		i -= 1
		if ct0 == 6:
			break
		if s[i] == '0':
			ct0 += 1
	p = s.find('1')
	if ct0 != 6 or p < 0 or p > i:
		print('no')
	else:
		print('yes')


def main():
	n = input()
	j = 0
	for i in range(len(n)):
		if n[i] == '1':
			j = i
			break
	else:
		print('no')
		return
	cont = 0
	for i in range(j, len(n)):
		if n[i] == '0':
			cont = cont + 1
	if cont >= 6:
		print('yes')
	else:
		print('no')
main()


a = [str(i) for i in input()]
ctr = 0
while a[0] == '0' and len(a) > 1:
	del a[0]
size = len(a)
for i in range(size):
	if a[i] == '0':
		ctr += 1
if ctr >= 6:
	print('yes')
else:
	print('no')


S = input()
firstone = len(S)
for i in range(0, len(S)):
	if S[i] == '1':
		firstone = i
		break
zerocount = 0
for i in range(firstone + 1, len(S)):
	if S[i] == '0':
		zerocount += 1
if zerocount >= 6:
	print('yes')
else:
	print('no')


x = str(input())
y = len(x)
cont = 0
if y < 7:
	print('no')
elif int(x) < 1000000:
	print('no')
else:
	d = int(x)
	d = str(d)
	for c in range(1, len(d)):
		if d[c] == '1':
			cont += 1
	if len(d) - cont < 7:
		print('no')
	else:
		print('yes')


ins = input()
ans = 'no'
if len(ins) >= 7:
	for i in range(len(ins)):
		if ins[i] == '1':
			tmp = ins[i:]
			if len(tmp) >= 7 and len(tmp) - tmp.count('1') + 1 >= 7:
				ans = 'yes'
				break
print(ans)


from sys import stdin, stdout

def rint():
	return map(int, stdin.readline().split())
a = input()
found1 = 0
count0 = 0
for aa in a:
	if found1 == 0:
		if aa == '1':
			found1 = 1
		continue
	elif aa == '0':
		count0 += 1
if found1 and count0 >= 6:
	print('yes')
else:
	print('no')


n = input()
l = list(n)[::-1]
while '1' in l[:6]:
	del l[l.index('1')]
if len(l) > 6 and '1' in l:
	print('yes')
else:
	print('no')


x = str(input())
h = {0: 0}
g = True
for j in x:
	if int(j) == 1:
		g = False
	if g is False and int(j) == 0:
		h[0] += 1
if h[0] >= 6:
	print('yes')
else:
	print('no')


a = int(input())
Ch = []
m = 1
k = 1
while True:
	Ch.append(int(a % 10))
	a = a // 10
	k = k + 1
	if k == 100:
		break
Ch.append(a)
Ch.reverse()
if Ch.count(1) >= 1:
	while Ch[0] != 1:
		Ch.remove(Ch[0])
	if Ch.count(0) >= 6:
		print('yes')
		m = 0
	if m == 1:
		print('no')
else:
	print('no')


s = input()
if len(s) < 7:
	res = (7 - len(s)) * '0' + s
else:
	res = s
try:
	ind = res.index('1')
	if res[ind:].count('0') >= 6:
		print('yes')
	else:
		print('no')
except:
	print('no')


s = input()
m = 0
while m < len(s) and s[m] == '0':
	m += 1
s = s[m:]
k = s.count('0')
if k >= 6:
	print('yes')
else:
	print('no')


b = input()
n = len(b)
if len(b) < 7 or '1' not in b:
	print('no')
else:
	first = b.index('1')
	print(('no', 'yes')[first < n - 6 and b[first + 1:].count('0') >= 6])


def main():
	binario = input()
	if len(binario) <= 6:
		print('no')
		return
	if '1' not in binario[0:-6]:
		print('no')
		return
	while True:
		if len(binario) <= 6 or '1' not in binario:
			print('no')
			return
		if '1' not in binario[-6:]:
			print('yes')
			return
		binario = binario[0:-6] + binario[-6:].replace('1', '')
main()


s = list(input())
ans = 'no'
cnt = -1
for c in s:
	if c == '1':
		cnt = max(cnt, 0)
	elif 0 <= cnt:
		cnt += 1
if 6 <= cnt:
	ans = 'yes'
print(ans)


a = input()
l = 0
while l < len(a) and a[l] == '0':
	l += 1
ans = 0
while l < len(a):
	if a[l] == '0':
		ans += 1
	l += 1
if ans >= 6:
	print('yes')
else:
	print('no')


print(['no', 'yes'][str(int(input())).count('0') > 5])


try:
	string = input()
	one = string.index('1')
	string = string[one:]
	num = string.count('0')
	if num >= 6:
		print('yes')
	else:
		print('no')
except:
	print('no')


s = input()
counter = 0
ok = False
for i in range(len(s) - 1, -1, -1):
	if s[i] == '0':
		counter += 1
	if counter >= 6:
		if s[i] == '1':
			ok = True
if ok:
	print('yes')
else:
	print('no')


a = input()
b = a.find('1')
if b == -1:
	print('no')
else:
	a = a[b:]
	if a.count('0') > 5:
		print('yes')
	else:
		print('no')


x = int(input())
b = str(x).count('0')
if b >= 6:
	print('yes')
else:
	print('no')


n = input()
r = 0
cnt = 0
for i in n:
	if r:
		if i == '0':
			cnt += 1
			if cnt == 6:
				break
		continue
	if i == '1':
		r = 1
if cnt == 6:
	print('yes')
else:
	print('no')


x = input()
count = 0
flag = 0
for i in x:
	if i == '1':
		flag = 1
	elif i == '0' and flag == 1:
		count = count + 1
if count >= 6:
	print('yes')
else:
	print('no')


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


s = input()
a = 0
if len(s) < 7:
	print('no')
	exit(0)
l = list(s)
n = s.find('1')
if n != -1:
	for i in range(n, len(l)):
		if l[i] == '0':
			a += 1
			if a >= 6:
				print('yes')
				exit(0)
print('no')


from sys import exit
s = [int(i) for i in input()]
if len(s) <= 6:
	print('no')
	exit()
c = 0
s = s[::-1]
for i in range(len(s)):
	if c == 6:
		break
	if s[i] == 0:
		c += 1
if c < 6:
	print('no')
	exit()
for j in range(i, len(s)):
	if c == 7:
		break
	if s[j] == 1:
		c += 1
if c == 7:
	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')


import sys
s = input()
if len(s) < 7:
	print('no')
	sys.exit(0)
else:
	zeros = 0
	for i in range(len(s) - 1, -1, -1):
		if s[i] == '0':
			zeros += 1
		if zeros >= 6 and s[i] == '1':
			print('yes')
			sys.exit(0)
print('no')


print('yes' if str(int(input())).count('0') > 5 else 'no')


try:
	while True:
		L = list(input())
		one = sum((1 for x in L if x == '1'))
		i = len(L) - 1
		while one > 1:
			if L[i] == '1':
				L.pop(i)
				one -= 1
			i -= 1
		tmp = int(''.join(L), 2)
		print('yes' if tmp % 64 == 0 and tmp else 'no')
except:
	pass


s = str(input())
k = 0
for el in s:
	if el != '1':
		k += 1
	else:
		break
if s.count('1') >= 1 and s.count('0') - k >= 6:
	print('yes')
else:
	print('no')


z = 0
o = 0
n = list(str(input()))
for idx in range(-1, -len(n) - 1, -1):
	if n[idx] == '0':
		z += 1
	if n[idx] == '1' and z >= 6:
		o += 1
print('yes') if o > 0 else print('no')


s = input()
s = list(s)
b = []
d = []
c = 6
d = 6
p = 0
if len(s) <= 7 and s.count('0') == len(s):
	print('no')
elif len(s) < 7 and s.count('0') != len(s):
	print('no')
elif len(s) == 7:
	for i in range(len(s) - 1, -1, -1):
		if s[i] == '0':
			if d == 0:
				continue
			d = d - 1
		if d == 0:
			if s.count('1') == 1 and s[0] == '1':
				p = 1
	if p == 1 and d == 0:
		print('yes')
	else:
		print('no')
elif len(s) > 7:
	for i in range(len(s) - 1, -1, -1):
		if s[i] == '0':
			if c == 0:
				continue
			c = c - 1
		if c == 0:
			if s[i] == '1':
				p = p + 1
	if p >= 1 and c == 0:
		print('yes')
	elif p < 1 or c != 0:
		print('no')


number = input().strip()
numZero = 0
sliceNum = ''
for x in range(len(number)):
	if number[x] == '1':
		sliceNum = number[x:]
		break
for x in range(len(sliceNum)):
	if sliceNum[x] == '0':
		numZero += 1
if numZero >= 6:
	print('yes')
else:
	print('no')


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


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


s = input()
f = 0
if len(s) < 7 or s.find('1') == -1:
	print('no')
else:
	for i in range(s.find('1'), len(s)):
		if s[i] == '0':
			f += 1
	if f < 6:
		print('no')
	else:
		print('yes')


s = input()
(g, k, f) = (0, 0, 0)
for z in s:
	if z == '0':
		k += 1
	else:
		f += 1
for z in s:
	if z == '1':
		break
	g += 1
k -= g
if k > 5 and f > 0:
	print('yes')
else:
	print('no')


s = input()
c = 0
bl = False
for i in s:
	if bl and i == '0':
		c += 1
	elif not bl and i == '1':
		bl = True
if c >= 6:
	print('yes')
else:
	print('no')


def divi_64(string):
	try:
		location_1 = string.index('1')
	except:
		return 'no'
	length = len(string)
	new_str = string[location_1:length]
	num_0 = new_str.count('0')
	if num_0 >= 6:
		return 'yes'
	else:
		return 'no'
str = input()
ans = divi_64(str)
print(ans)


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


from math import gcd, ceil
from collections import defaultdict as dd

def lcm(a, b):
	return a * b // gcd(a, b)

def inin():
	return int(input())

def inar():
	return list(map(int, input().split()))

def ar(element, size):
	return [element for i in range(size)]

def digitsum(num):
	su = 0
	while num:
		su += num % 10
		num //= 10
	return su
bi = input()
bi = bi[::-1]
cnt0 = 0
cnt1 = 1
for i in bi:
	if i == '0' and cnt0 < 6:
		cnt0 += 1
	if i == '1' and cnt0 >= 6:
		cnt1 += 1
if cnt1 > 1:
	print('yes')
else:
	print('no')


import re
s = input()
match = re.match('0+', s)
st = 0
if match:
	st = len(match.group(0))
cnt = 0
for i in range(st, len(s)):
	if s[i] == '0':
		cnt += 1
if cnt >= 6:
	print('yes')
else:
	print('no')


s = input()
i = 0
while i < len(s) and s[i] == '0':
	i += 1
s = s[i:]
if len(s) - s.count('1') + 1 >= 7:
	print('yes')
else:
	print('no')


b = list(input())
b = list(map(int, b))
for i in range(len(b)):
	if b[i] == 1:
		if b[i:].count(0) > 5:
			print('yes')
			exit()
		else:
			print('no')
			exit()
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')


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


n = input()
try:
	i = n.index('1')
	if n[i + 1:].count('0') < 6:
		print('no')
	else:
		print('yes')
except:
	print('no')


s = input()
n = len(s)
flag = False
for i in range(n):
	if s[i] == '1':
		cnt = 0
		for j in range(i, n):
			if s[j] == '0':
				cnt += 1
		if cnt >= 6:
			flag = True
			break
		if flag == True:
			break
if flag == True:
	print('yes')
else:
	print('no')


s = input()
i = 0
c = 0
k = 0
while i < len(s):
	if s[i] == '1':
		k = 1
	if s[i] == '0' and k == 1:
		c = c + 1
		if c == 6:
			break
	i = i + 1
if c == 6:
	print('yes')
else:
	print('no')


s = input()
ind = -1
for i in range(len(s)):
	if s[i] == '1':
		ind = i
		break
if ind == -1:
	print('no')
	exit()
cnt = 0
for i in range(ind + 1, len(s)):
	if s[i] == '0':
		cnt += 1
if cnt >= 6:
	print('yes')
else:
	print('no')


i = input()
a = list(i)
if a.count('1') == 0:
	print('no')
	exit(0)
while a[0] != '1':
	del a[0]
if len(a) < 7:
	print('no')
	exit(0)
else:
	zero = a.count('0')
	if zero >= 6:
		print('yes')
	else:
		print('no')


str = input()
counter = 0
mark = 0
for item in str:
	if item == '0' and mark == 1:
		counter += 1
	elif item == '1' and mark == 0:
		mark = 1
if counter >= 6:
	print('yes')
else:
	print('no')


a = input()
x = len(a)
if x < 7:
	print('no')
elif a.count('1') == 0:
	print('no')
else:
	c = 0
	for i in range(a.index('1'), x):
		if a[i] == '0':
			c += 1
	if c >= 6:
		print('yes')
	else:
		print('no')


def main():
	s = list(input())
	s = s[-1::-1]
	n = len(s)
	del_count = 0
	div = False
	for i in range(n):
		if i - del_count < 6:
			if s[i] == '1':
				del_count += 1
		elif s[i] == '1':
			div = True
			break
	if div:
		print('yes')
	else:
		print('no')
main()


a = input()
counter = 0
flag = True
flagForOne = False
for i in a:
	if not flagForOne and i == '1':
		flagForOne = True
	if flagForOne and i == '0':
		counter += 1
		if counter >= 6:
			print('yes')
			flag = False
			break
if flag:
	print('no')


from sys import stdin

def main():
	s = stdin.readline()
	first1 = s.find('1')
	if first1 < 0:
		return 'no'
	if s[first1 + 1:].count('0') >= 6:
		return 'yes'
	return 'no'
print(main())


s = input()
s = s.lstrip('0')
x = s.count('0')
print(['no', 'yes'][x >= 6])


def main():
	s = input()
	l = list(s)
	l.reverse()
	count = 0
	for c in l:
		if count < 6 and c == '0':
			count += 1
		elif count >= 6 and c == '1':
			print('yes')
			return
	print('no')
main()


a = input()
array = list(a)
birBulundu = False
sifirSayisi = 0
for i in array:
	if i == '1':
		birBulundu = True
	elif birBulundu == True:
		sifirSayisi = sifirSayisi + 1
if sifirSayisi > 5:
	print('yes')
else:
	print('no')


n = input()
for (i, x) in enumerate(n):
	if x == '1':
		break
if n[i:].count('0') >= 6:
	print('yes')
else:
	print('no')


smstr = input().lstrip('0')
if '1' in smstr and smstr.count('0') >= 6:
	print('yes')
else:
	print('no')


x = input()
if len(x) < 7:
	print('no')
else:
	zeros = 0
	one = False
	for i in range(len(x) - 1, -1, -1):
		if zeros < 6:
			if x[i] == '0':
				zeros += 1
		elif x[i] == '1':
			print('yes')
			ones = True
			exit()
	print('no')


s = input()
s = s.lstrip('0')
if s.count('0') > 5:
	print('yes')
else:
	print('no')


str = input()
l = len(str)
flag = 0
ok = 0
for i in range(l - 1, -1, -1):
	if flag < 6 and str[i] == '0':
		flag = flag + 1
	elif flag == 6 and str[i] == '1':
		ok = 1
if ok:
	print('yes')
else:
	print('no')


a = '1000000'
b = input()
c = 0
for i in range(len(b)):
	if a[c] == b[i]:
		c += 1
		if c == len(a):
			break
print('yes' if c == len(a) else 'no')


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


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


import sys
import math
import bisect

def solve(s):
	cnt = 0
	tmp = 0
	for c in s:
		if c == '1':
			tmp = 1
		if tmp == 1 and c == '0':
			cnt += 1
	return cnt >= 6

def main():
	if solve(input()):
		print('yes')
	else:
		print('no')
main()


k = input()
for i in range(len(k)):
	s = k
	i = 0
	while i < len(s) and s[i] != '1':
		i += 1
	count = 0
	while i < len(s):
		if s[i] == '0':
			count += 1
		i += 1
	if count >= 6:
		print('yes')
		exit(0)
print('no')


import sys
x = list(input())
if len(x) > 100:
	sys.exit()
for i in x:
	if i == '0' or i == '1':
		continue
	else:
		sys.exit()
if '1' not in x:
	print('no')
else:
	new = x[x.index('1'):]
	c = new.count('0')
	if c > 5:
		print('yes')
	else:
		print('no')


def solution():
	a = input()
	if len(a) < len('1000000'):
		return 'no'
	z = 0
	for c in a[::-1]:
		if c == '0':
			z += 1
		elif z >= 6:
			return 'yes'
	return 'no'
print(solution())


from sys import stdin, stdout
n = stdin.readline()
m = n
for i in range(len(n)):
	if n[i] != '1':
		m = m[1:]
	if n[i] == '1':
		break
zero = m.count('0')
if zero < 6:
	stdout.write('no')
else:
	stdout.write('yes')


d = input()
b = d
for (i, a) in enumerate(d):
	if a == '0':
		b = d[i + 1:]
	elif a == '1':
		break
c = sum((1 for a in b if a == '0'))
if c >= 6:
	print('yes')
else:
	print('no')


import sys
a = input()
if len(a) < 7:
	print('no')
else:
	for i in range(len(a)):
		if a[i] == '1':
			if a[i:].count('0') > 5:
				print('yes')
				sys.exit()
	print('no')


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


n = input()
f = n.find('1')
print('no') if f < 0 or n[f:].count('0') < 6 else print('yes')


s = input()[::-1]
count = 0
st = False
for i in s:
	if i == '0':
		count += 1
	elif count >= 6:
		st = True
		break
if st:
	print('yes')
else:
	print('no')


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


take = input()
check = False
ans = 0
for i in take:
	if i == '1':
		check = True
	if check and i == '0':
		ans += 1
if ans >= 6:
	print('yes')
else:
	print('no')


a = input()
a = a[a.find('1'):]
g = 0
for i in a:
	if i == '0':
		g = g + 1
if g >= 6:
	print('yes')
else:
	print('no')


l = input()
while len(l) > 0 and l[0] == '0':
	l = l[1:]
cnt = 0
for i in l:
	if i == '0':
		cnt += 1
if cnt >= 6:
	print('yes')
else:
	print('no')


n = input()
if len(n) < 7:
	print('no')
elif n.count('0') < 6 or n.count('1') < 1:
	print('no')
else:
	r = n.find('1')
	n = n[r + 1:]
	if n.count('0') > 5:
		print('yes')
	else:
		print('no')


s = str(int(input()))
if s.count('0') > 5 and s.count('1') > 0:
	print('yes')
else:
	print('no')


N = input()
chkstr = '000000'
if len(N) <= 6:
	print('no')
elif N[-6:] == chkstr:
	flag = False
	for ch in N[:-6]:
		if ch == '1':
			flag = True
			break
	if flag:
		print('yes')
	else:
		print('no')
else:
	while len(N) != 0:
		if N[0] == '0':
			N = N[1:]
		else:
			break
	cnt = 0
	while len(N) != 0:
		if N[-1] == '0':
			cnt += 1
		N = N[:-1]
	if cnt >= 6:
		print('yes')
	else:
		print('no')


a = input()
flag = 0
if len(a) < 7:
	print('no')
else:
	for i in range(len(a)):
		if a[i] == '1':
			a = a[i:]
			flag = 1
			break
	x = a.count('0')
	if x >= 6 and flag == 1:
		print('yes')
	else:
		print('no')


s = input()
if len(s) < 7:
	print('no')
	exit(0)
r = reversed(s)
cpt = 0
one = False
for d in r:
	if d == '0':
		cpt += 1
	if cpt >= 6 and d == '1':
		one = True
if one:
	print('yes')
else:
	print('no')


s = input()
zeroes = 0
flag = 0
for x in s:
	if x == '1':
		flag = 1
	if x == '0' and flag == 1:
		zeroes += 1
if zeroes >= 6:
	print('yes')
else:
	print('no')


n = 0
a = input()
for i in a[::-1]:
	if i == '0':
		n = n + 1
	if n >= 6 and i == '1':
		print('yes')
		exit()
print('no')


n = str(input())
n = list(n)
if n.count('1') == 0:
	print('no')
	exit(0)
k = 0
for i in range(len(n)):
	if n[i] == '1':
		k = i
		break
if n[k:].count('0') >= 6:
	print('yes')
else:
	print('no')


s = input()
res = False
while s.rfind('1') != s.find('1'):
	s = s[0:s.rfind('1')] + s[s.rfind('1') + 1:]
if '1000000' in s:
	print('yes')
else:
	print('no')


s = input()
l = [i for i in s]
if int(s) > 0 and len(s) >= 7:
	j = l.index('1')
	l = l[j + 1:]
	if l.count('0') >= 6:
		print('yes')
	else:
		print('no')
else:
	print('no')


def div_64(s):
	if '1' not in s:
		return 'no'
	idx = s.index('1')
	s = s[idx:]
	zero_quantity = s.count('0')
	if zero_quantity < 6:
		return 'no'
	return 'yes'
print(div_64(input()))


x = input().lstrip('00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000')
if x.count('0') >= 6 and x.count('1') >= 1:
	print('yes')
else:
	print('no')


b = str(input())
c = 0
if '1' not in b:
	print('no')
else:
	for i in range(len(b)):
		if b[i] == '1':
			idx = i
			break
	for i in range(idx, len(b)):
		if b[i] == '0':
			c += 1
	if c >= 6:
		print('yes')
	else:
		print('no')


A = list(map(int, input()))
index = -1
k = 0
for i in range(len(A)):
	if A[i] == 1:
		index = i
		break
for i in range(index, len(A)):
	if A[i] == 0:
		k += 1
if index != -1 and k >= 6:
	print('yes')
else:
	print('no')


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


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


s = str(input())
ans = False
p = False
count = 0
for i in range(len(s)):
	if p:
		if s[i] == '0':
			count += 1
	elif s[i] == '1':
		p = True
	if count == 6:
		ans = True
if ans:
	print('yes')
else:
	print('no')


st = input()
pos = st.find('1')
if pos == -1:
	print('no')
else:
	cnt = 0
	for i in range(pos, len(st)):
		cnt += st[i] == '0'
	if cnt > 5:
		print('yes')
	else:
		print('no')


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


def main():
	S = input()
	cnt = S.count('1')
	txt = S[::-1]
	txt = txt.replace('1', '', cnt - 1)
	txt = txt[::-1]
	if '1000000' in txt:
		print('yes')
	else:
		print('no')
main()


a = input()
a = a[::-1]
teste = False
ind = 0
for i in range(len(a)):
	if a[i] == '1' and i >= 6:
		ind = i
cnt = 0
for i in range(0, ind):
	if a[i] == '1':
		cnt += 1
if len(a) - (len(a) - ind) - cnt >= 6:
	print('yes')
else:
	print('no')


from math import ceil
for _ in range(1):
	s = input()
	if len(s) < 7:
		print('no')
	elif s.count('1') == 0:
		print('no')
	elif s.count('1000000') >= 1:
		print('yes')
	else:
		cnt = 0
		f = 0
		for i in range(0, len(s)):
			if s[i] == '0' and f == 1:
				cnt += 1
			if s[i] == '1' and f == 0:
				f = 1
		if cnt >= 6:
			print('yes')
		else:
			print('no')


a = input()
c = 0
for i in range(0, len(a)):
	if a[i] == '1':
		c = i
		break
if c == 0 and a[0] == '0':
	print('no')
else:
	ans = 0
	for i in range(c, len(a)):
		if a[i] == '0':
			ans += 1
	if ans > 5:
		print('yes')
	else:
		print('no')


s = input()
i = len(s) - 1
c = 0
while i >= 0 and c < 6:
	if s[i] == '1':
		pass
	else:
		c += 1
	i -= 1
if c < 6:
	print('no')
	exit()
while i >= 0:
	if s[i] == '1':
		print('yes')
		exit()
	i -= 1
print('no')


class stack:

	def __init__(self):
		self.slist = []
		self.length = 0

	def push(self, element):
		self.slist += [element]
		self.length += 1

	def pop(self):
		if self.length > 0:
			self.length -= 1
			c = self.slist[self.length]
			self.slist = self.slist[:self.length]
			return c
		return -1

	def top(self):
		if self.length > 0:
			return self.slist[self.length - 1]
		return -1
a = [i for i in input()]
a = a[::-1]
s = stack()
c = False
if len(a) >= 7:
	cont = 0
	while cont != 7 and a != []:
		if cont < 6:
			if a[0] == '0':
				s.push('0')
				cont += 1
		elif a[0] == '1':
			s.push('1')
			cont += 1
		a = a[1:]
	if cont == 7:
		c = True
if c:
	print('yes')
else:
	print('no')


InputString = input()
FoundAOne = False
ZeroCount = 0
for i in range(len(InputString)):
	if InputString[i] == '1':
		FoundAOne = True
	if FoundAOne and InputString[i] == '0':
		ZeroCount += 1
if ZeroCount >= 6:
	print('yes')
else:
	print('no')


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


import sys
import os
import math
import re
a = input().lstrip('0')
if a.count('0') >= 6:
	print('yes')
else:
	print('no')


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


str = input()
numzero = 0
found = 0
pos = 0
for i in range(0, len(str)):
	if int(str[i]) == 1:
		found = 1
		pos = i
		break
for i in range(pos, len(str)):
	if int(str[i]) == 0:
		numzero += 1
if found == 1 and numzero >= 6:
	print('yes')
else:
	print('no')


s = input()
s = list(reversed(s))
zero_count = 0
one = False
for c in s:
	if c == '0':
		zero_count += 1
	elif zero_count >= 6:
		one = True
		break
print('yes' if one else 'no')


import sys
import math
strs = str(input())
flag = False
if len(strs) <= 6 or strs.count('0') < 6:
	print('no')
else:
	for i in range(len(strs) - 6):
		if strs[i] == '1':
			stra = strs[i + 1:]
			zero = stra.count('0')
			ones = stra.count('1')
			if zero >= 6:
				flag = True
		if flag == True:
			break
	if flag == True:
		print('yes')
	else:
		print('no')


import string
str = input()
flag = 0
num = 0
for x in str:
	if x == '1':
		flag = 1
	if flag and x == '0':
		num += 1
if num >= 6:
	print('yes')
else:
	print('no')


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


t = input()
try:
	lt = t.index('1')
except:
	print('no')
else:
	ans = t[lt:].count('0') >= 6 and len(t) - lt > 6
	if ans:
		print('yes')
	else:
		print('no')


s = input()
pos = -1
cnt = 0
for i in range(len(s) - 1, -1, -1):
	if s[i] == '1':
		pos = i
for i in range(pos, len(s)):
	if s[i] == '0':
		cnt += 1
if cnt >= 6 and pos != -1:
	print('yes')
else:
	print('no')


s = bin(64)[2:]
t = str(input())
output = 'no'
for j in range(len(t)):
	if t[j] == s[0]:
		(ps, pt, count) = (0, j, 0)
		while ps < len(s) and pt < len(t):
			if s[ps] == t[pt]:
				ps += 1
				count += 1
			pt += 1
		if count == len(s):
			output = 'yes'
			break
print(output)


S = input()
b = 0
k = 0
for i in range(len(S)):
	if S[i] == '1':
		b = b + 1
	if S[i] == '0' and b > 0:
		k = k + 1
if k >= 6:
	print('yes')
else:
	print('no')


num = input()
if len(''.join(num.split('1')[1:])) >= 6:
	print('yes')
else:
	print('no')


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


s = input()
s = s[::-1]
while s != '' and int(s, 2) != 0:
	if int(s[::-1], 2) % 64 == 0:
		print('yes')
		break
	for i in range(len(s)):
		if s[i] == '1':
			s = s[:i] + s[i + 1:]
			break
else:
	print('no')


def main():
	line = input()
	sour = line
	tmp = line
	for i in range(len(line)):
		if line[i] == '0':
			tmp = tmp[1:]
		else:
			break
	line = tmp
	s = len(line)
	c = 0
	for i in range(len(line) - 1):
		if line[s - i - 1] == '1':
			tmp = tmp[:s - i - 1] + tmp[s - i:]
			c += 1
	if len(tmp) > 6:
		print('yes')
	else:
		print('no')
main()


s = s1 = input()
c = 0
for i in range(len(s) - 1, -1, -1):
	if c == 6 and s1.count('1') != 0:
		print('yes')
		exit()
	if s[i] == '0':
		c += 1
	else:
		s1 = s1[:i] + s1[i + 1:]
print('no')


num = [int(x) for x in input()]
if 1 not in num:
	print('no')
else:
	first_index = num.index(1)
	if num[first_index + 1:].count(0) >= 6:
		print('yes')
	else:
		print('no')


import re
import sys
import math
import itertools
import collections

def inputArray(TYPE=int):
	return [TYPE(x) for x in input().split()]

def solve():
	s = input()
	z = 0
	pos = 0
	for x in s[::-1]:
		pos += 1
		if x == '0':
			z += 1
			if z == 6:
				break
	print('yes' if '1' in s[:-pos] else 'no')
solve()


from collections import deque
from math import log, sqrt, ceil

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def li():
	return list(mi())
s = si()
s = list(s)
if '1' in s:
	x = s.index('1')
	c = 0
	for i in range(x, len(s)):
		if s[i] == '0':
			c += 1
	if c >= 6:
		print('yes')
	else:
		print('no')
else:
	print('no')


s = input()
n = int(s)
if str(n).count('0') >= 6:
	print('yes')
else:
	print('no')


string = input()
if len(string) < 6:
	print('no')
elif '0' not in string:
	print('no')
else:
	flag = False
	count = 0
	for i in string:
		if i == '1':
			flag = True
		if i == '0' and flag:
			count += 1
	if flag and count >= 6:
		print('yes')
	else:
		print('no')


s = input().strip()
ans = False
for i in range(len(s)):
	if s[i] == '1':
		if s[i:].count('0') >= 6:
			ans = True
			break
print(['no', 'yes'][ans])


t = input()
if len(t) < 7:
	print('no')
else:
	(flag, c) = (0, 0)
	for i in t:
		if i == '1':
			flag = 1
		if flag == 1 and i == '0':
			c += 1
		if c > 6:
			break
	if c < 6:
		print('no')
	else:
		print('yes')


s = input()
count = 0
have = False
for i in range(0, len(s)):
	if s[i] == '0' and have:
		count += 1
	if s[i] == '1':
		have = True
if count >= 6:
	print('yes')
else:
	print('no')


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


string = input()
beg = 0
while beg < len(string) and string[beg] == '0':
	beg += 1
zero_count = 0
for idx in range(len(string) - 1, beg - 1, -1):
	c = string[idx]
	if c == '0':
		zero_count += 1
if zero_count >= 6:
	print('yes')
else:
	print('no')


strs = input()
if len(strs) <= 6:
	print('no')
else:
	i = 0
	found = False
	strs = strs[::-1]
	sums = 0
	while i < len(strs) and sums < 6:
		if strs[i] == '0':
			sums += 1
		i += 1
	if sums < 6:
		print('no')
	else:
		while i < len(strs):
			if strs[i] == '1':
				found = True
				break
			i += 1
		if found == True:
			print('yes')
		else:
			print('no')


ss = int(input())
s = str(ss)
count = 0
x = len(s)
for i in range(1, x):
	if s[i] == '1':
		count += 1
if x - count > 6:
	print('yes')
else:
	print('no')


x = int(input())
y = str(x)
u = y.replace('1', '')
p = '1' + u
s = int(p)
if s % 64 == 0:
	print('yes')
else:
	print('no')


n = str(input())
pos = n.find('1')
if pos == -1:
	print('no')
elif n[pos:].count('0') < 6:
	print('no')
else:
	print('yes')


s = input()
k = 0
for i in range(len(s) - 1):
	if s[i] == '1':
		break
	k += 1
s1 = s[k:]
if s1.count('1') >= 1 and s1.count('0') >= 6:
	print('yes')
else:
	print('no')


s = input()
ones = s.count('1')
can = False
zeros = 0
for i in range(len(s) - 1, -1, -1):
	if s[i] == '0':
		zeros += 1
	elif zeros >= 6:
		can = True
if can:
	print('yes')
else:
	print('no')


s = input()
news = ''
flag = 0
if len(s) < 7:
	flag = 1
for i in range(len(s) - 1, -1, -1):
	if len(news) >= 6:
		news += s[i]
	elif s[i] == '0':
		news += '0'
news = news[::-1]
if '1' not in news:
	flag = 1
if len(news) < 7:
	flag = 1
if flag == 1:
	print('no')
else:
	print('yes')


s = input()
(c1, c2) = (0, 0)
if set(s) == {'0'}:
	print('no')
else:
	for i in range(len(s)):
		if s[i] == '1':
			c1 += 1
			if c1 == 1:
				c2 = i
	p = len(s) - (c1 - 1) - c2
	print('yneos'[p < 7::2])


(cnt, f1, f2) = (0, False, False)
for b in input()[::-1]:
	if b == '0':
		cnt += 1
	if cnt >= 6:
		f1 = True
		if not f2:
			if b == '1':
				f2 = True
				break
print('yes') if f1 and f2 else print('no')


string = input()
zero = 0
one = 0
flag = False
f = False
for n in range(len(string)):
	i = len(string) - n - 1
	if string[i] == '0':
		zero = zero + 1
	if zero >= 6:
		flag = True
	if flag and string[i] == '1':
		print('yes')
		f = True
		break
	if i == 0 and (not f):
		print('no')


s = input()
s = list(s)
c = -1
for i in s:
	if i == '1' and c == -1:
		c = 0
	if i == '0' and c != -1:
		c += 1
if c >= 6:
	print('yes')
else:
	print('no')


ivestis = input()
taip = False
for i in range(len(ivestis)):
	if ivestis[i] == '1':
		nuliu_skc = 0
		for z in ivestis[i:]:
			if z == '0':
				nuliu_skc += 1
		if nuliu_skc >= 6:
			taip = True
if taip == True:
	print('yes')
else:
	print('no')


s = input().strip()
if len(s) < 7:
	print('no')
else:
	k = 0
	for i in range(len(s)):
		if s[i] == '1':
			j = i + 1
			while j < len(s):
				if s[j] == '0':
					k += 1
				j += 1
			break
	if k >= 6:
		print('yes')
	else:
		print('no')


s = input()[::-1]
cnt = 0
for c in s:
	if c == '0':
		cnt += 1
	elif cnt >= 6:
		cnt = -1
		break
if cnt == -1:
	print('yes')
else:
	print('no')


n = input()
if n.count('1') == 0:
	print('no')
for i in range(len(n)):
	if n[i] == '1':
		if n[i:].count('0') >= 6:
			print('yes')
			break
		else:
			print('no')
			break
	else:
		continue


s = str(int(input()))
k = 0
for i in range(len(s)):
	if s[i] == '0':
		k += 1
if k >= 6:
	print('yes')
else:
	print('no')


st = input()
ans = 'no'
k_0 = 0
if int(st) < 1000000:
	ans = 'no'
else:
	st = int(st)
	st = str(st)
	for e in st:
		if e == '0':
			k_0 += 1
		if k_0 == 6:
			ans = 'yes'
			break
print(ans)


s = input()
a = []
if len(s) < 7:
	print('no')
else:
	for i in range(s.find('1'), len(s)):
		if i >= len(s) - 6:
			if int(s[i]) != 1:
				a.append(int(s[i]))
		else:
			a.append(int(s[i]))
	if 1 in a and a.count(0) >= 6:
		print('yes')
	else:
		print('no')


s = input()
n = len(s)
cnt = 0
for i in range(n):
	if s[i] == '1':
		cnt = 0
		for j in range(i, n):
			if s[j] == '0':
				cnt += 1
			if cnt > 5:
				print('yes')
				exit(0)
else:
	print('no')


list = [int(i) for i in input()]
st = True
counter = 0
for k in range(0, len(list) - 1):
	if list[k] == 1:
		for m in range(k, len(list)):
			if list[m] == 0:
				counter += 1
		break
if counter >= 6:
	print('yes')
else:
	print('no')


n: str = input()
print('yes' if n.lstrip('0').count('0') >= 6 else 'no')


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


print('yes' if sum((1 for x in input().partition('1')[2] if x == '0')) >= 6 else 'no')


strr = input()

def slove():
	res = 0
	num = 0
	cot = 0
	for i in strr:
		num += 1
		if i == '1':
			res = 1
			break
	for i in strr[num:]:
		if i == '0':
			cot += 1
	if cot > 5 and res == 1:
		print('yes')
	else:
		print('no')
slove()


import re
import inspect
from sys import argv, exit

def rstr():
	return input()

def rint():
	return int(input())

def rints(splitchar=' '):
	return [int(i) for i in input().split(splitchar)]

def varnames(obj, namespace=globals()):
	return [name for name in namespace if namespace[name] is obj]

def pvar(var, override=False):
	prnt(varnames(var), var)

def prnt(*args, override=False):
	if '-v' in argv or override:
		print(*args)
a = int(rstr())
a = str(a)
if int(a) == 0:
	print('no')
	exit()
if a.count('0') >= 6:
	print('yes')
else:
	print('no')


n = input()
q = n.find('1')
ans = 0
if q == -1:
	print('no')
	exit()
for i in range(q, len(n)):
	if n[i] == '0':
		ans += 1
print('yes' if ans > 5 else 'no')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
import random
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def main():
	s = S()
	t = 0
	for c in s[::-1]:
		if c == '0':
			t += 1
		elif t > 5:
			return 'yes'
	return 'no'
print(main())


s = list(input())
s = s[::-1]
sum1 = 0
j = 0
nd = 0
nk = 0
for i in s:
	if i == '0':
		nd += 1
	if nd >= 6 and i == '1':
		nk = 1
		break
if nk == 1:
	print('yes')
else:
	print('no')


def main():
	string = input()
	if string.count('0') < 6:
		print('no')
		return
	if string.count('1') < 1:
		print('no')
		return
	if string.count('1') > 1:
		while string.count('1') != 1:
			string = string[:string.rfind('1')] + string[string.rfind('1') + 1:]
	if string.find('1') < string.rfind('000000'):
		print('yes')
		return
	print('no')
main()


binary = input()
if binary.count('0') != len(binary) and binary[binary.index('1') + 1:].count('0') >= 6:
	print('yes')
else:
	print('no')


ch = input()
if '1' in ch and ch[ch.index('1'):].count('0') > 5:
	print('yes')
else:
	print('no')


n = list(str(input()))
if len(n) < 7:
	ans = 'no'
elif '1' not in n:
	ans = 'no'
else:
	i = n.index('1')
	if n[i:].count('0') >= 6:
		ans = 'yes'
	else:
		ans = 'no'
print(ans)


s = input()
cnt = 0
flag = -1
tmp = 0
for i in range(0, len(s)):
	tmp = s[i]
	if int(tmp) == 1:
		flag = i
		break
if flag == -1:
	print('no')
else:
	for i in range(flag, len(s)):
		tmp = s[i]
		if int(tmp) == 0:
			cnt += 1
	if cnt >= 6:
		print('yes')
	else:
		print('no')


arr = map(str, input())
tot = 0
flag = False
for x in arr:
	if x == '0' and flag:
		tot += 1
	elif x == '1':
		flag = True
if tot >= 6:
	print('yes')
else:
	print('no')


n = input()
if len(n) < 7:
	print('no')
	exit()
cnt = 0
last_pos = 0
for i in range(0, len(n))[::-1]:
	if n[i] == '0':
		cnt += 1
		last_pos = i
	else:
		n = n[:i] + n[i + 1:]
	if cnt == 6:
		break
if cnt < 6 or len(n) < 6:
	print('no')
	exit()
for i in n[:last_pos]:
	if i == '1':
		print('yes')
		exit()
print('no')


def izabella(s):
	(count1, count2, ind) = (0, 0, 0)
	for i in range(len(s)):
		if s[i] == '1':
			ind = i
			break
	for elem in s[ind:]:
		if elem == '0':
			count1 += 1
		if elem == '1':
			count2 += 1
	if count1 >= 6 and count2 > 0:
		return 'yes'
	return 'no'
print(izabella(input()))


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


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


def countZeros(x):
	res = -1000000
	for i in range(len(x)):
		if x[i] == '1' and res < 0:
			res = 0
		if x[i] == '0':
			res += 1
	return res
number = input()
if countZeros(number) >= 6:
	print('yes')
else:
	print('no')


p = str(input(''))
s = 0
answer = 'no'
for i in range(len(p) - 1, -1, -1):
	if s >= 6 and int(p[i]) == 1:
		answer = 'yes'
		break
	elif int(p[i]) == 0:
		s += 1
	else:
		continue
print(answer)


while True:
	try:
		a = input()
		sum = 0
		m = -1
		for i in range(len(a)):
			if a[i] == '1':
				m = i
				break
		if m != -1:
			for i in range(m, len(a)):
				if a[i] == '0':
					sum += 1
		if m == -1:
			print('no')
		elif sum >= 6:
			print('yes')
		else:
			print('no')
	except EOFError:
		break


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


N = list(input())
if len(N) >= 7:
	if '1' in N:
		S = N.count('1')
		if S == 1:
			H = N.index('1')
			H1 = N[H:]
			if H1.count('0') >= 6:
				print('yes')
			else:
				print('no')
		else:
			W = len(N) - (S - 1)
			if W >= 7:
				H = N.index('1')
				H1 = N[H:]
				if H1.count('0') >= 6:
					print('yes')
				else:
					print('no')
			else:
				print('no')
	else:
		print('no')
else:
	print('no')


import re
data = input()
ans = re.search('.*1(.*0){6}.*', data)
print('yes' if ans else 'no')


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


while True:
	try:
		s = input()
	except:
		break
	x = len(s)
	num = -1
	for c in s[:]:
		if num < 0 and c == '1':
			num += 1
		elif num >= 0 and c == '0':
			num += 1
	if num >= 6:
		print('yes')
	else:
		print('no')


s = input()
x = int(s, 2)
xl = [int(i) for i in s]
if x < 64 or 1 not in xl:
	print('no')
elif xl[xl.index(1) + 1:].count(0) < 6:
	print('no')
else:
	print('yes')


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


line = list(input())
cont0 = 0
hay1 = False
for e in line:
	if e == '1' and (not hay1):
		hay1 = True
	if e == '0' and hay1:
		cont0 += 1
if cont0 > 5:
	print('yes')
else:
	print('no')


import sys
line = sys.stdin.readline()
isYes = False
zeros = 0
for digit in line[::-1]:
	if zeros >= 6 and digit == '1':
		isYes = True
		break
	if digit == '0':
		zeros += 1
if isYes:
	print('yes')
else:
	print('no')


s = list(input())
i = 0
flag = True
while i < len(s):
	if s[i] == '0' and flag == True:
		s.pop(i)
	elif s[i] == '1' and flag == True:
		i += 1
		flag = False
	elif s[i] == '1' and flag == False:
		s.pop(i)
	else:
		i += 1
s = ''.join(s)
if '1000000' in s:
	print('yes')
else:
	print('no')


import sys
s = input()
one = False
zero_count = 0
for i in s:
	if one:
		if i == '0':
			zero_count += 1
			if zero_count == 6:
				print('yes')
				sys.exit()
		continue
	if i == '1':
		one = True
print('no')


C = input()
C = str(C)
U = C.find('1')
if U == -1:
	print('no')
else:
	CAux = C[U:]
	if CAux.count('0') >= 6:
		print('yes')
	else:
		print('no')


s = str(input())
n = len(s)
le = int(len(s))
bo = True
znum = 0
for i in range(n):
	if znum != 6:
		if s[n - i - 1] == '0':
			znum += 1
		else:
			le -= 1
		if le < 7:
			print('no')
			bo = False
			break
	elif s[n - i - 1] == '1':
		print('yes')
		bo = False
		break
if bo:
	print('no')


from sys import stdin, exit
s = stdin.readline().strip()
pos = s.find('1')
if pos != -1:
	s = s[pos:]
	if s[0] == '1' and s[1:].count('0') >= 6:
		print('yes')
		exit()
print('no')