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;
string s;
int hsh[200003],cnt[2019],pw[200003];
long long ans;
int main(){
	cin>>s;cnt[0]=1;pw[0]=1;
	for(int i=0;i<s.size();i++)pw[i+1]=pw[i]*10%2019;
	for(int i=0;i<s.size();i++)hsh[i+1]=(hsh[i]+(s[i]-'0')*pw[s.size()-i-1])%2019,cnt[hsh[i+1]]++;
	for(int i=0;i<2019;i++)
		ans+=cnt[i]*(cnt[i]-1)/2;
	cout<<ans;
}