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 Fortran (GNU Fortran 9.2.1) (judge verdict: Wrong Answer)

program multiple_of_2019
  implicit none
  character(200000) :: s
  integer :: n, d, k, i, j, l = 0
  integer(8) :: dp(0:1,0:2018) = 0, a = 0
  read(*,*) s
  n = len_trim(s)
  do i = 1, n
    l = 1-l
    dp(l,:) = 0
    d = ichar(s(i:i))-48
    do j = 0, 2018
      k = mod(10*j+d,2019)
      dp(l,k) = dp(l,k)+dp(1-l,j)
      a = a+dp(1-l,j)
    end do
    dp(l,d) = dp(l,d)+1
  end do
  write(*,'(i0)') a+dp(l,0)
end program multiple_of_2019