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 N=2e5+10;
typedef long long LL;
LL ans,now,tmp;
int num[3000],n;
char s[N];
int c(char ch){
	return ch-'0';
}
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	num[0]=1;
	int now=1;
	for(int i=n;i;i--){
		tmp+=now*c(s[i]);
		tmp%=2019;
		ans+=num[tmp];num[tmp]++;
		now*=10;
		now%=2019;
	}
	cout<<ans<<endl;
}