s = input().lstrip("0");n=s.count("0");print("YNEOS"[n<6::2])
#include<bits/stdc++.h>
using namespace std;
#define str string
#define dbl double
#define ll long long
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
// freopen("input.txt","r",stdin);
// freopeb("output.txt","w",stdout);
int main(){
string s;
cin >> s;
ll k=0,r=0;
for (int i=0;i<s.size();++i){
if(s[i]=='1'){k=1;}
if(k==1){
if(s[i]=='0')r++;
}
}
if(k==0)cout<<"NO"<< endl;
else if ( k==1 && r>=6){
cout<<"YES" << endl;
}
else cout<<"NO" << endl;}
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |