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
import java.util.*;

public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        int[] count = new int[2019];
        int mul = 1;
        int ans = 0;
        int tmp = 0;
        for (int i = s.length() - 1; i >= 0; i--) {
            // T (n+1) = T (n) + 10 * An
            tmp = (tmp + mul * (s.charAt(i) - '0')) % 2019;
            if (tmp == 0) ans++;
            ans += count[tmp];
            count[tmp]++;
            mul = mul * 10 % 2019;
        }
        System.out.println(ans);
    }
}