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>
#define mod 2019

using namespace std;

int P = 1, N, ans;
string s;
unordered_map < int , int > M;

int main () {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> s;
  M[0] = 1;
  for (int i = s.size() - 1; i >= 0; --i) {
    N = (N + P * (s[i] - '0')) % mod;
    P = (P * 10) % mod;
    ans += M[N];
    M[N] ++;
  }
  cout << ans;
}
