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 <iostream>
#include <set>
 
using namespace std;

int fr[200000];
int main(){
	
	cin.tie(0); ios_base::sync_with_stdio(0);
	string en;
	cin>>en;
	int b = 1;
	fr[0]  =1;
	int s = 0;
	long long res = 0;
	for(int i=en.length()-1;i>=0;i--){
		s = (s+b*(en[i]-'0'))%2019;
		res+=fr[s];
		fr[s]++;
		b = (b*10)%2019;
	}
	cout<<res<<endl;
	
	return 0;
}