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 in = new Scanner(System.in);
        String s = in.next();
        int len = s.length();
        int[] mod2019count = new int[2019];
        long count = 0;
        for(int i=0; i<len; i++) {
            int[] newModCount = new int[2019];
            int theDigit = Integer.parseInt(s.substring(i, i+1));
            for(int j=0; j<2019; j++) {
                int mod = (j*10 + theDigit) % 2019;
                newModCount[mod] = mod2019count[j];
            }
            int mod = theDigit % 2019;
            newModCount[mod]++;
            
            count += newModCount[0];
            mod2019count = newModCount;
        }
        System.out.println(count);
    }
}
