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 Julia (1.4.0) (judge verdict: Accepted)

parseInt(x)=parse(Int, x)
parseMap(x::Array{SubString{String},1})=map(parseInt, x)

function main()
	s = parseMap(split(chomp(readline()),""))
	n = length(s)
	dp = zeros(Int,n)
	dp[n]=s[n]
	dx = zeros(Int,n)
	dx[1]=10
	for i in 2:n
		dx[i]=(dx[i-1]*10)%2019
	end
	for i in n-1:-1:1
		dp[i]=(dp[i+1]+(s[i]*dx[n-i])%2019)%2019
	end
	d = Dict{Int,Int}()
	d[0]=1
	for i in 1:n
		if haskey(d,dp[i])
			d[dp[i]]+=1
		else
			d[dp[i]]=1
		end
	end
	ct = 0
	for i in keys(d)
		ct+=(d[i]*(d[i]-1))>>1
	end
	println(ct)
end

main()