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;
const int N=200005;
char s[N];
long long ans,a[N],p[N];
int main()
{
	scanf("%s",s+1);
	int n=strlen(s+1),t=0;
	a[t]++;
	p[n+1]=1;
	for(int i=n;i>=1;i--)
	{
		int x=s[i]-'0';
		p[i]=p[i+1]*10%2019;
		t=(t+x*p[i])%2019;
		a[t]++;
	}
	for(int i=0;i<2019;i++)
		ans+=a[i]*(a[i]-1)/2;
	cout<<ans<<endl;
	return 0;
}