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 <stdio.h>
char s[200010];
int c[2020], inv = 202;
int main() {
    int ans = 0, tt = 1, cur = 0;
    scanf("%s", s);
    c[0] = 1;
    for (int i = 0; s[i]; i++) {
        int x = s[i] - '0';
        cur = (cur * 10 + x) % 2019;
        tt = (tt * inv) % 2019;
        ans += c[(cur * tt) % 2019];
        c[(cur * tt) % 2019]++;
    }
    printf("%d\n", ans);
    return 0;
}
