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

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner sc = new Scanner(System.in);
        String givenNum = sc.next();
        givenNum = new StringBuilder(givenNum).reverse().toString();
        int x = 1, tot = 0;
        List<Integer> cnt = new ArrayList<>(2019);
        for (int i = 0; i < 2019; i++) {
            cnt.add(0);
        }
        long ans = 0;
        for (int i = 0; i < givenNum.length(); i++) {
            cnt.set(tot, cnt.get(tot) + 1);
            tot += (givenNum.charAt(i) - '0') * x;
            tot %= 2019;
            ans += cnt.get(tot);
            x = x * 10 % 2019;
        }
        System.out.println(ans);
    }
}
