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: Wrong Answer)

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,4)
	for i in 4:n
		a = s[i-3]*1000+s[i-2]*100+s[i-1]*10+s[i]
		if a%2019==0
			if i>4
				dp[i,1] = sum(dp[i-4,:])+1
			else
				dp[i,1] = 1
			end
		end
		if i>4
			a += s[i-4]*10000
			if a%2019==0
				if i>5
					dp[i,2] = sum(dp[i-5,:])+1
				else
					dp[i,2] = 1
				end
			end
			if i>5
				a += s[i-5]*100000
				if a%2019==0
					if i>6
						dp[i,3] = sum(dp[i-6,:])+1
					else
						dp[i,3] = 1
					end
				end
				if i>6
					a += s[i-6]*1000000
					if a%2019==0
						if i>7
							dp[i,4] = sum(dp[i-7,:])+1
						else
							dp[i,4] = 1
						end
					end
				end
			end
		end
	end
	println(sum(dp))
end

main()