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;
typedef long long ll;

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  string s;
  cin >> s;
  reverse(s.begin(), s.end());
  map<int,int> cnt;
  int rem = 0;
  ll ans = 0;
  cnt[0]++;
  ll pow10 = 1;
  for (char c : s) {
    rem = (rem+(c-'0')*pow10)%2019;
    pow10 = pow10*10%2019;
    ans += cnt[rem]++;
  }
  cout << ans << endl;
}
