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