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()
ans=0
MOD=2019
cnt=[0]*MOD
cur=0
cnt[cur]=1
d=1
for s in S[::-1]:
  cur+=int(s)*d
  cur%=MOD
  cnt[cur]+=1
  d*=10
  d%=MOD
for c in cnt:
  ans+=c*(c-1)//2
print(ans)