Div. 64（简单暴力）

Div. 64

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

只要是能包含1后面6个0即可经过删除位被64整除因为1000000是64，所以只要存在1后面6个0即可

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
    string s;
    cin >> s;
    int cnt0 = 0;
    int flag = 0;
    for(int i = s.length(); i >= 0; i--){
        if(cnt0 < 6 && s[i] == '0') cnt0++;
        else if(cnt0 >= 6 && s[i] == '1'){
            flag = 1;
            break;
        }
    }
    if(flag) printf("yes\n");
    else printf("no\n");
    return 0;
}