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;
unsigned short F[200000][2019]; 
int main(){
  string S; cin >> S; int i, r, N=S.size();
  for(i=0; i<N; i++){ F[i][S[i]-'0']=1; }  
  for(i=0; i<N-1; i++){ for(r=0; r<2019; r++){ 
    F[i+1][(10*r+(S[i+1]-'0'))%2019]+=F[i][r];
  } }
  long ans=0;
  for(i=0; i<N; i++){ ans+=F[i][0]; }
  cout << ans << "\n";
}