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) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        int a[] = new int[2019];
        a[0] = 1;
        String s = in.next();
        int len = s.length(), x = 0, n = 1, ans = 0;
        for (int i = len - 1; i >= 0; i--) {
            x = (x + (s.charAt(i) - '0') * n) % 2019;
            ans += a[x];
            a[x]++;
            n = (n * 10) % 2019;
        }
        System.out.println(ans);
    }

}
