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,l,ans,j,sek,keta,nlist(200000/2019)
    character(200000):: s,bs

    read*, s
    n = len_trim(s)

    ans=0
    i=1

    do i=1, size(nlist)
        nlist(i) = 2019*i
    end do

    do i=1, size(nlist)
        write(bs,*)nlist(i)
        bs=adjustl(bs)
        l = len_trim(bs)
        if (l > n) cycle
        do j=1,n-l+1
            if (s(j:j+l-1) == trim(bs)) ans=ans+1 
        end do
    end do
    print'(i0)', ans
end program