Given is a string S consisting of digits from `1` through `9`.

Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:

Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.

Constraints

* 1 ≤ |S| ≤ 200000
* S is a string consisting of digits from `1` through `9`.

Input

Input is given from Standard Input in the following format:


S


Output

Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.

Examples

Input

1817181712114


Output

3


Input

14282668646


Output

2


Input

2119


Output

0
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
int main(){
string s;
cin>>s;int res=0;
vector<int>dp(2019);
for(char&c:s){
	vector<int>dp1(2019);
	for(int i=0;i<2019;i++){
		
		dp1[(i*10+(c-'0'))%2019]	+=dp[i];
	}
	dp1[c-'0']++;
	res+=dp1[0];
	dp.swap(dp1);
	
	

}
cout<<res;

return 0;
}
