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()
a,b=0,[0]*2019
b[0]+=1
for i in range(len(s)-1,-1,-1):
    a=(a+int(s[i])*pow(10,len(s)-i-1,2019))%2019
    b[a]+=1
c=0
for i in b:
    c+=i*(i-1)
print(c//2)