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;

const int mod = 2019;
string s;
int main() {
  cin >> s;
  int n = s.size();
  
  map<int, int> mp;
  int curr = 0;
  int base = 1;
  mp[0] = 1;
  
  long sum = 0;
  for (int i = n - 1; i >= 0; --i) {
    curr = (curr + base * (long)(s[i] - '0')) % mod;
    base = base * 10 % mod;
    sum += mp[curr];
    ++mp[curr];
  }
  cout << sum << endl;
}