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 PHP (7.4.4) (judge verdict: Wrong Answer)

<?php
$s=trim(fgets(STDIN));
$n=strlen($s);
if($n<4){
  echo 0;
  exit;
}
$i=0;
$ans=0;
$t=$s[0]+$s[1]+$s[2];
while($i<$n-3){
  $sum=$t;
  $ss=$s[$i].$s[$i+1].$s[$i+2];
  $j=$i+3;
  while($j<$n){
    $sum+=$s[$j];
    if($sum%3==0){
      $ss.=$s[$j];
      if($ss%673==0){
        ++$ans;
      }
    }
    ++$j;
  }
  $t+=$s[$i+3]-$s[$i];
  ++$i;
}
echo $ans;