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;
int main()
{
	string a;
	cin>>a;
	int n= a.size();
	reverse(a.begin(),a.end());
	vector<int> s(2019);
	s[0]++;
	int sum=0,ten=1;
	long long ans=0;
	for(int i=0;i<n;i++)
	{
		sum+=(a[i]-'0')*ten;
		sum%=2019;
		ans+=s[sum];
		s[sum]++;
		ten*=10;
		ten%=2019;
	}
	cout<<ans;
	return 0;
}
