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 h[2019],t=1,c;
int main(){
	string s;
	long long ans=0;
	int i,j;
	cin>>s;
	int n=s.size();
	s=' '+s;
	for(i=n;i;--i)++h[c=(c+(s[i]-'0')*t)%2019],t=t*10%2019;
	ans+=h[0];
	for(i=0;i<2019;++i)ans+=h[i]*(h[i]-1)>>1;
	cout<<ans;
}