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 Ruby (2.7.1) (judge verdict: Wrong Answer)

s = gets.chomp!
mods = Array.new(s.size + 1, 0)
(mods.size - 2).downto(0){|i|
	mods[i] = (mods[i + 1] + s[i].to_i * (10 ** (s.size - i - 1))) % 2019;
}
p mods
puts 2019.times.sum{|i| m = mods.count(i); m * (m - 1) / 2}