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<cstdio>
#include<cstring>

typedef long long ll;
const int maxn = 2E+5 + 5;

int n;
ll S, ans, base;
int sum[2025];
char s[maxn];

int main() {
	scanf("%s", s + 1);
	n = std::strlen(s + 1);
	
	sum[0] = 1, base = 1;
	for(int i = n; i >= 1; --i) {
		S = (S + (s[i] - '0') * base) % 2019ll;
		ans += sum[S]++, base = base * 10 % 2019ll;
	}
	printf("%lld", ans);
}