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;

typedef pair<int,int> PII;
typedef long long LL;
const int M=2e5+5;
const int MO=2019;

char s[M];
int cnt[MO];

int main()
{
	scanf("%s",s);
	int n=strlen(s);
	cnt[0]=1;
	int now=0;
	int p=1;
	LL ans=0;
	for(int i=n-1;i>=0;i--,p=p*10%MO)
	{
		now=(now+(s[i]-'0')*p)%MO;
		ans+=cnt[now];
		cnt[now]++;
	}
	printf("%lld\n",ans);
	return 0;
}