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;

long long n,dp[2020],a,ans,jum(1),sum;
string s;
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>s;
	dp[0]++;
	for(int i=s.length()-1;i>=0;i--)
	{
		a=s[i]-'0';
		sum=(sum+jum*a)%2019;
		jum=jum*10%2019;
		dp[sum]++;
	}
	for(int i=0;i<2019;i++)
	{
		ans+=dp[i]*(dp[i]-1)>>1;
	}
	cout<<ans<<'\n';
}