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<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
	int n,N,ansPre[2019]={0},ans[2019]={0},res=0;
	string S;
	cin>>S;
	N=S.length();
	for(int i=0;i<N;i++){
		n=S[i]-'0';
		fill(ans,ans+2019,0);
		ans[n]+=1;
		for(int j=0;j<=2018;j++)ans[(j*10+n)%2019]+=ansPre[j];
		for(int j=0;j<=2018;j++)ansPre[j]=ans[j];
		res+=ans[0];
	}
	cout<<res;
	return 0;
}