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;
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;
	cin>>s;
	ll ans=0;
	vector<ll>rem(2019, 0);
	rem[0]=1;
	ll n=0,ex=1;
	for(ll i=(ll)s.size()-1;i>=0;i--){
		n=(n+(s[i]-'0')*ex)%2019;
		ans+=rem[n];
		rem[n]++;
		ex=ex*10%2019;
	}
	cout<<ans<<"\n";
}