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 {
    private static int mod = 2019;

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String[] s = scan.next().split("");
        scan.close();

        int[] amari = new int[2019];
        amari[0] = 1;
        int tenMod = 1;
        int nowMod = 0;
        for (int i = s.length - 1; i >= 0; i--) {
            nowMod += tenMod * Integer.parseInt(s[i]);
            nowMod %= mod;
            amari[nowMod]++;

            tenMod *= 10;
            tenMod %= mod;
        }

        long ans = 0;
        for (int i = 0; i < amari.length; i++) {
            ans += amari[i] * (amari[i] - 1) / 2;
        }
        System.out.println(ans);
    }
}
