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 main(){
  string s;cin>>s;
  int n=s.size();
  int c=0; int b=1;
  int* r=new int[n+1]{};
  int* cc=new int[2019]{};
  cc[0]++;
  for(int i=n-1;i>=0;i--){
    r[i]=(r[i+1]+b*(s[i]-'0'))%2019;
    b=(b*10)%2019;
    c+=cc[r[i]];cc[r[i]]++;
  }
  cout << c << endl;
  return 0;
}  
