CodeForces628-B.New Skateboard

 

B. New Skateboard

 

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and started to press the keys randomly. Unfortunately Max has forgotten the number which he had calculated. The only thing he knows is that the number is divisible by 4.

You are given a string s consisting of digits (the number on the display of the calculator after Yusuf randomly pressed the keys). Your task is to find the number of substrings which are divisible by 4. A substring can start with a zero.

A substring of a string is a nonempty sequence of consecutive characters.

For example if string s is 124 then we have four substrings that are divisible by 4: 12, 4, 24 and 124. For the string 04 the answer is three: 0, 4, 04.

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use gets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

Input

The only line contains string s (1 ≤ |s| ≤ 3·10⁵). The string s contains only digits from 0 to 9.

Output

Print integer a — the number of substrings of the string s that are divisible by 4.

Note that the answer can be huge, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.

Examples

Input

124

Output

4

Input

04

Output

3

Input

5810438174

Output

9

 

题意就是找有多少个子串可以被4整除。因为100可以被4整除，所以100位以上的都可以，只要看个位和十位的数是否可以被4整除。
写这个题的时候傻了，只是算一下个位和十位就好了，然后把前面的位数加上就可以了，。
因为想一下，举个例子，xyzab，如果ab%4==0，那么xyzab可以组成多少个子串呢？那就是ab，zab，yzab，xyzab，就是a所在的位置啊，因为是从0开始的，所以位数+1，我可能是个傻子。。。
这样这道题就可以a了。

代码:

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 const int N=*1e5+;
 char a[N];
 int main(){
     while(~scanf("%s",a)){
     ll len,cnt,ans;
     len=strlen(a);
     ans=;
     for(int i=;i<len;i++){
         if((a[i]-'')%==)ans++;
     }
     for(int i=;i<len-;i++){
         cnt=(a[i]-'')*+(a[i+]-'');
         if(cnt%==)ans+=i+;
     }
     cout<<ans<<endl;
     }
     return ;
 }