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;
int main(void){
  string s; cin>>s;
  map<int,int> mp; mp[0]=1;
  int n=s.size(),t=1,m=0;
  while(n--){
    m+=(int)(s[n]-'0')*t;
    if(m>2018) m%=2019;
    t*=10;
    if(t>2018) t%=2019;
    ++mp[m];
  }
  n=mp.size();
  int res=0;
  for(auto& itr:mp) res+=itr.second*(itr.second-1)/2;
  cout<<res;
  return 0;
}