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) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        int[] mod = new int[2019];
        mod[0]++;
        int now = 0;
        int d = 1;
        for (int i = S.length()-1; i >= 0; i--) {
            int a = S.charAt(i)-'0';
            now += d*a;
            now %= 2019;

            mod[now]++;

            d *= 10;
            d %= 2019;
        }

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