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;
#define N 200005 
#define MOD 2019
#define ll long long 
int n,s,vs[MOD];ll ans;char a[N];
int main()
{
	vs[0]=1;scanf("%s",a+1);n=strlen(a+1);
	for(int i=n,t=1;i>=1;--i,t=t*10%MOD)
		s=(s+(a[i]-'0')*t)%MOD,ans+=vs[s],++vs[s];
	printf("%lld\n",ans);return 0;
}