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
import sys
range = xrange
input = raw_input

mod = 2019

S = input()
X = [0]
power = 1
for c in reversed(S):
    X.append((int(c) * power + X[-1]) % mod)
    power = power * 10 % mod

counter = [0]*mod
for x in X:
    counter[x] += 1

ans = 0
for c in counter:
    ans += c * (c - 1) // 2
print ans
