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 long long ll;
const int maxn=2e5+9;
int main()
{
	char s[maxn];
	scanf("%s",s+1);
	int len=strlen(s+1);
	ll f[maxn]={1};
	ll ans=0,k=1,base=0;
	for(int i=len;i>=1;i--)
	{
		int num=s[i]-'0';
		base=(base+num*k)%2019;
		ans+=f[base];
		k=(k*10)%2019;
		f[base]++;
	}
	printf("%lld\n",ans);
}
