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 maxn=200004;
int rmd[maxn];
int pref[maxn];
char s[maxn];
int main(){
	cin>>(s+1);
	int base=1;
	long long cnt=0;
	rmd[0]=1;
	int len=strlen(s+1);
	for(int i=len;i>=1;i--){
		pref[i]=(pref[i+1]+base*(s[i]-'0'))%2019;
		base=base*10%2019;
		cnt+=rmd[pref[i]];
		rmd[pref[i]]++;
	}
	printf("%lld\n",cnt);
}