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
#include <bits/stdc++.h>
using namespace std;

int main() {
  string s;
  cin >> s;
  long long ans = 0, dp[2][2019] = {};
  int k = 0;
  for (auto c : s) {
    auto d = c - '0';
    for (int j = 0; j < 2019; j++) dp[k][(j * 10 + d) % 2019] = dp[k ^ 1][j];
    dp[k][d]++;
    ans += dp[k][0];
    k ^= 1;
  }
  cout << ans << endl;
  return 0;
}
