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>
#define ll long long
using namespace std;
int dp[2][2020];
int main(){
	string s;
	ll ans=0;
	cin>>s;
	for(int i=0;i<s.length();i++){
		for(int j=0;j<2019;j++)dp[(i+1)%2][j]=0;
		int k=s[i]-'0';
		dp[(i+1)%2][k]=1;
		for(int j=0;j<2019;j++)dp[(i+1)%2][(j*10+k)%2019]+=dp[i%2][j];
		ans+=dp[i%2][0];
	}
	ans+=dp[s.length()%2][0];//ans累加
	cout<<ans;
	return 0;
}