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
a = [int(c) * pow(10, i, 2019) % 2019 for i, c in enumerate(reversed(input()))]
s = [0]
for x in a:
  s += [(s[-1] + x) % 2019]
cnt, ans = [0] * 2019, 0
for x in s:
  ans += cnt[x]
  cnt[x] += 1
print(ans)
