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;
using ll=long long;
constexpr ll mod=1000000007;

string S;
int cc,p;
ll T[2019],res;

int main(){
	cin>>S;
	T[0]++;
	reverse(S.begin(),S.end());
	p=1;
	for(char c:S){
		cc+=p*(c-'0');
		cc%=2019;
		T[cc]++;
		p*=10;
		p%=2019;
	}
	for(int i=0;i<2019;i++){
		res+=T[i]*(T[i]-1)/2;
	}
	cout<<res<<endl;
}
