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<iostream>
#include<string>
using namespace std;

int dp[2][2020];

int main(){
  string S;
  cin>>S;
  int ans=0;
  for(int i=0;i<S.size();i++){
    dp[i%2][S[i]-'0']+=1;
    for(int j=0;j<2020;j++){
      int s=(j*10+(S[i]-'0'))%2019;
      dp[i%2][s]+=dp[(i+1)%2][j];
    }
    for(int j=0;j<2020;j++)dp[(i+1)%2][j]=0;
    ans+=dp[i%2][0];
  }
  cout<<ans<<endl;
  
}
