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 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String s = scanner.next();

        int count = 0;
        int current = 0;

        int[] mod = new int[2020];
        mod[2019]++;
        mod[0]++;

        int rem = 1;

        for (int i = s.length()-1; i >=0; i--) {

            int a = s.charAt(i) - '0';
            rem *= 10;
            rem %= 2019;

            current = (a*rem + current ) % 2019;

            count+=mod[current];

            mod[current ]++;
        }

        System.out.println(count);
    }
}