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.ArrayList;
import java.util.HashMap;

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int[] remainder_mapping = new int[2019];
        remainder_mapping[0]++;
        Scanner sc = new Scanner(System.in);
        String target_string = sc.next();
        int remainder = 0;
        int pow_of_ten = 1;
        for(int i = target_string.length()-1 ;i >= 0; i--){
            int target_number = (target_string.charAt(i) - '0');
            remainder += target_number*pow_of_ten;
            remainder %= 2019;
            remainder_mapping[remainder]++;
            pow_of_ten *= 10;
            pow_of_ten %= 2019;
        }
        int answer = 0;
        for(int i = 0;i < 2019;i++){
            int candidates = remainder_mapping[i];
                answer += ((candidates-1)*candidates)/2;
        }
        System.out.println(answer);
    }
}
