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=len(s)
b=a-4
c=0
mod=2019
num=[0]*mod
num[0] = 1
now=0
ans=0
_10 = 1
for i in range(a-1, -1, -1):
    now=(now+int(s[i])*_10)%mod
    _10*=10
    _10%=mod
    ans+=num[now]
    num[now]+=1
print(ans)