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;
typedef long long ll;
const int N=2e6+10;
string s;
ll a[N];
int main() {
	ll ans=0,i,t,c;
	cin>>s;
	a[0]=1;
	t=0;
	c=1;
	for (i=s.length()-1;i>=0;i--) {
		t=t+(s[i]-'0')*c;
		t%=2019;
		c=(c*10)%2019;
		a[t]++;
	}
	for (i=0;i<=2018;i++)
		ans+=a[i]*(a[i]-1)/2;
	cout<<ans<<endl;
	return 0; 
} 