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;
  const int n=s.size();
  vector<int> v(2019);
  v.at(0)=1;
  int t=0;
  int pow=1;
  for(int i=n-1;i>=0;i--){
    t=(t+(s.at(i)-'0')*pow)%2019;
    v.at(t)+=1;
    pow*=10;
    pow%=2019;
  }
  long long ans=0;
  long long m;
  for(int j=0;j<2019;j++){
    m=v.at(j);
    ans+=m*(m-1)/2;
  }
  cout << ans;
}