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;
int modune[2019];
int main()
{
	string input;
	cin>>input;
	int precal=0,p=1;
	modune[0]=1;
	for(int i=input.length()-1;i>=0;i--)
	{
		precal=(precal+(p*(input[i]-'0'))%MOD)%MOD;
		p=(p*10)%MOD;
		modune[precal]++;
	}
	long long output=0;
	for(int i=0;i<2019;i++)
		output+=(modune[i]*(modune[i]-1))/2;
	cout<<output<<endl;
}