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 mod=2019;
string s;
int ans,g[200001],a[2019],ls;
signed main()
{
	int x,y=0;
	g[0]=1;
	for(int i=1;i<=200000;i++)
	g[i]=g[i-1]*10%mod;
	cin>>s;
	ls=s.size();
	a[0]=1;
	for(int i=ls-1;i>=0;i--)
	{
		x=(s[i]-'0')*g[ls-i-1]%mod;
		ans+=a[(x+y)%mod];
		a[(x+y)%mod]++;
		y=(x+y)%mod;
	}
	printf("%lld",ans);
	return 0;
}
