Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

1817181712114

Sample Output 1

3

Three pairs - (1,5), (5,9), and (9,13) - satisfy the condition.

Sample Input 2

14282668646

Sample Output 2

2

Sample Input 3

2119

Sample Output 3

0

No pairs satisfy the condition.

Solution in Rust (1.42.0) (judge verdict: Runtime Error)

fn main() {
    proconio::input! {
        s: u64,
    }
    let a: &str = &s.to_string();
    let mut num: u64;
    let mut res = 0;
    let mut cnt = 3;
    while cnt < a.chars().count(){
        for i in 0..(a.chars().count()-cnt) {
            num = (&a[i..(i+cnt+1)]).parse().unwrap();
            if num % 2019 == 0{
                res += 1;
            }
        }
        cnt += 1;
    }
    println!("{}", res);
}