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;
long long tot[2105],z[200010];
int main()
{
	string s;
	int i;
	long long x=1,ans;
	cin>>s;
	for(i=s.size()-1;i>=0;i--)
	{
		z[i]=(z[i+1]+(s[i]-'0')*x)%2019;
		x=x*10%2019;
		tot[z[i]]++;
	}
	ans=tot[0];
	for(i=0;i<2019;i++)
		ans+=tot[i]*(tot[i]-1)/2;
	cout<<ans;
	return 0;
}