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.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        String s = sc.next();
        int[] mod = new int[2019];
        mod[0] = 1;
        int[] sums = new int[s.length() + 1];
        int idx = 1;
        int count = 0;
        for (int i = s.length() - 1; i >= 0; i--) {
            int num = ((s.charAt(i) - '0') * idx + sums[i + 1]) % 2019;
            sums[i] = num;
            count += mod[num];
            mod[num]++;
            idx = idx * 10 % 2019;
        }
        System.out.println(count);
    }
}
