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<long long> dp(2019);
  long long ans = 0LL;
  for (char c : s) {
  	vector<long long> dp2(2019);
    for (int i = 0; i < 2019; i++) {
    	dp2[(i * 10 + (c - '0')) % 2019] += dp[i]; 
    }
    dp2[c - '0']++;
    ans += dp2[0];
    dp.swap(dp2);
  }
  cout << ans << endl;
}
