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
////D
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[2019],ans;
 
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	string str;
	cin>>str;
	a[0]=1;
	ll t=0,cnt=1;
	for(int idx=str.length()-1;idx>=0;idx--){
		t=(t+cnt*(str[idx]-'0')%2019)%2019;
		//cout<<t<<endl;
		ans+=a[t];
		a[t]++;
		cnt=cnt*10%2019;
	}
	cout<<ans<<endl;
	return 0; 
}