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>
#define ll long long 
using namespace std;
char s[200005];
int a[2020];
int main()
{
	scanf("%s",&s);a[0]=1;
	int l=strlen(s)-1;int num=0,mod=2019;int ans=0,p=1;
	for(int i=l;i>=0;--i)
	{
	ans=(ans+(s[i]-'0')*p)%mod;
	num+=a[ans];a[ans]++;p=p*10%mod;
//	printf("ans:%d a[ans]:%d\n",ans,a[ans]);
	}
	printf("%d",num);
}