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: Accepted)

# n = gets.to_s.to_i
m = 2019
s = gets.to_s.chomp.bytes

ans = 0
# p '0'.ord #=> 48
if false # m == 2 || m == 5
  
  n.times{ |i| (s[i] - 48 )%m == 0 && ans+=(i+1) }

else
  
  h = Hash.new(0)
  h[0] = 1
  
  cur = 0
  p10 = 1
  
  s.reverse_each do |c|
    cur = ( cur + ( c - 48 ) * p10 ) % m
    ans += h[cur]
    h[cur] += 1
    p10 = p10 * 10 % m
  end
end

puts ans