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 main
    use,intrinsic :: iso_fortran_env
    implicit none
    integer(int64):: n,i,nl(0:2018),tmp,ans
    character(200000):: s

    read*, s
    n = len_trim(s)
    tmp=0
    nl(:) = 0
    nl(0) = 1
    do i=0,n-1
        tmp=mod(tmp+(ichar(s(n-i:n-i))-ichar('0'))*10**i,2019)
        nl(tmp)=nl(tmp)+1 
    end do

    ans=0
    do i=0,2018
        ans=ans+((nl(i)*(nl(i)-1))/2)
    end do

    print'(i0)', ans
end program