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;
using ll = long long;

const int m = 2019;

int main(){
  string s;
  cin >> s;
  int n=s.size();
  reverse(s.begin(),s.end());
  int x=1 ; int tot=0;
  vector<int> count(m);
  ll ans=0;
  for(int i=0; i<n; i++){
    count[tot]++;
    tot+=(s[i]-'0')*x;
    tot%=m;
    ans+=count[tot];
    x=x*10%m;
  }
  cout << ans << endl;
  return 0;
}