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;
#define int long long
signed main(){
  string S;
  cin>>S;
  map<int,int> A;
  A[0]++;
  int j=1,k=0;
  for(int i=0;i<S.size();i++){
    k=(k+j*(S[S.size()-1-i]-'0'))%2019;
    A[k]++;
    j=j*10%2019;
  }
  j=0;
  for(pair<int,int> p:A){
    j+=p.second*(p.second-1)/2;
  }
  cout<<j<<endl;
}