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)
a=[0]*(N+1)
m=2019
for i,c in enumerate(reversed(S)):
    a[i+1]=(int(c)*pow(10,i,m)+a[i])%m
from collections import Counter
c=Counter(a)
r=0
for k,v in c.items():
    r+=v*(v-1)//2
print(r)