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()
N = len(S)
P = 2019
 
res = 0
mp = [0]*P
mp[0] = 1
cur = 0
p10 = 1
for c in S[::-1]:
    cur = (cur + int(c)*p10) % P
    res += mp[cur]
    mp[cur] += 1
    p10 *= 10
    p10 %= P
 
print(res)