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
#abc164d
s=input()[::-1]
n=len(s)
cnt=[0]*2020
res=0
t=0
p=1
for c in s:
 c=int(c)
 t=(t+c*p)%2019
 p=(p*10)%2019
 cnt[t]+=1
res+=(cnt[0]+1)*cnt[0]//2
for i in cnt[1:]:
 res+=i*(i-1)//2
print(res)
