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()[::-1]
n=len(s)
a=[0]*2019
a[0]=1
x=1
p=0

for i in range(n):
    p+=x*int(s[i])
    p%=2019
    a[p]+=1
    x=(x*10)%2019
ans=0
for i in range(2019):
    ans+=a[i]*(a[i]-1)//2
print(ans)
