The 7th(2012) ACM Programming Contest of HUST  Preliminary Contest
From: 20121117 12:00:00
To: 20121117 17:00:00
Now: 20170922 06:49:55
Status: Public
A  Multiple
Time Limit: 2s
Memory Limit: 64MB
Submissions: 605 Solved: 159
 Description
 Rocket323 loves math very much. One day, Rocket323 got a number string. He could choose some consecutive digits from the string to form a number. Rocket323 loves 64 very much, so he wanted to know how many ways can he choose from the string so the number he got multiples of 64 ?
A number cannot have leading zeros. For example, 0, 64, 6464, 128 are numbers which multiple of 64 , but 12, 064, 00, 1234 are not.
 Input
 Multiple cases, in each test cases there is only one line consist a number string.
Length of the string is less than 3 * 10^5 .
Huge Input , scanf is recommended.
 Output
 Print the number of ways Rocket323 can choose some consecutive digits to form a number which multiples of 64.
 Sample Input

64064
 Sample Output

5
 Hint
 There are five substrings which multiples of 64.
[64]064
640[64]
64[0]64
[64064]
[640]64
 Source
 Problem Setter : Yang Xiao