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;
  vector<int> arr(2019);
  int res = 0;
  for (char c : s) {
    vector<int> new_arr(2019);
    int x = c - 48;
    for (int i = 0; i < 2019; ++i) {
      int y = (i * 10 + x) % 2019;
      new_arr[y] += arr[i];
    }
    new_arr[x]++;
    res += new_arr[0];
    arr = new_arr;
  }
  cout << res << endl;
}
