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.math.BigInteger;
import java.util.Scanner;

class Main {
    public static void main(final String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        StringBuffer str = new StringBuffer(s);
        String r = str.reverse().toString();
        int size = r.length();
        int ans = 0;
        int[] count = new int[2019];
        BigInteger total = BigInteger.ZERO;
        BigInteger mod = new BigInteger("2019");
        BigInteger exp = BigInteger.ONE;
        for (int i = 0; i < size; i++) {
            count[total.intValue()]++;
            total = total.add(new BigInteger(r.substring(i, i + 1)).multiply(exp)).remainder(mod);
            ans += count[total.intValue()];
            exp = exp.multiply(BigInteger.TEN).remainder(mod);
        }
        System.out.println(ans);
    }
}
