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;
const int mo=2019;
int a[200005];
string s;
int k;
int jojo;
int dio;
int gg;
int ans;
int main(){
	cin>>s;
	a[0]=1;
	k=1;
	for (int i=s.size()-1;i>=0;i--){
		jojo=s[i]-'0';
		dio=jojo*k+dio;
		dio%=mo;
		gg=dio%mo;
		a[gg]++;
		ans+=a[gg]-1;
		k*=10;
		k%=mo;
	}
	cout<<ans<<endl;
}