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>
using namespace std ;
string s;
int mod[200005],c[200005];
int i;
int main(){
	cin>>s;
	int a=1;
	for(i=s.size()-1;i>-1;i--){
		mod[i]=(mod[i+1]+(s[i]-'0')*a)%2019;
		a*=10;
		a%=2019;
	}
	int ans=0;
	for(i=0;i<=s.size();i++){
		ans+=c[mod[i]];
		c[mod[i]]+=1;
	}
	cout<<ans;
}                              