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 = list(map(int, input()[::-1]))

R=[0]
r=0
k=1
for c in S:
    r = (r+k*c) % 2019
    k = k*10 % 2019
    R.append(r)
    
N = [0]*2019
ans = 0
for r in R:
    ans += N[r]
    N[r] += 1
print(ans)
