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;

short dp[200009][2020];
int main(){
  string s;
  cin >> s;
  memset(dp, 0, sizeof(dp));
  dp[0][s[0]-'0']++;
  for(int i=1;i<s.length();i++){
    dp[i][s[i]-'0']++;
    for(int j=0;j<2019;j++){
      dp[i][(j*10+s[i]-'0')%2019]+=dp[i-1][j];
    }
  }
  int ans=0;
  for(int i=0;i<s.length();i++){
    ans += dp[i][0];
  }
  cout << ans << endl;
}

