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 sc = new Scanner(System.in);
        String s = sc.next();
        sc.close();

        int total = 0;

        int[] count = new int[2019];
        count[0]++;
        int ans = 0;
        int ten = 1;

        for (int i = 1; i <= s.length(); i++) {
            total += (s.charAt(s.length() - i) - '0') * ten;
            ten = ten * 10 % 2019;
            total %= 2019;
            count[total] += 1;
        }

        for (int i = 0; i < 2019; i++) {
            ans += count[i] * (count[i] - 1) / 2;
        }

        System.out.println(ans);
    }
}