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.

Examples

Input

1817181712114


Output

3


Input

14282668646


Output

2


Input

2119


Output

0
S = input()
 

dp = [0]*2019
c = 0
dp[0] = 1

p = 0
q = 1
for i in range(len(S)):
  p += int(S[len(S)-1-i])*q
  p %= 2019
  q *= 10
  q %= 2019
  dp[p] += 1
 
for j in dp:
  c += j * (j-1) // 2
print(c)