Introduction - If you have any usage issues, please Google them yourself
Now there is a very long string s, in which all characters are ' 0' to ' 9' . It represents a very large number. You want to know how many different sequences of the string is a multiple of five. A sub-sequence is defined as a string to remove some elements any of the rest. Sequences required for the pilot may have 0, but can not be empty. Because the results can be very large, you only need to output the answer to 1000000007 (10 ^ 9+7) take the remainder of the results can be.