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;

#define int long long

int32_t main()
{
  string s;
  cin>>s;
  int n=s.length(),k=2019,ans=0;
   vector<int>cnt(200005);
   ++cnt[0];
   int curr=0,prev=1;
    for(int i=n-1;i>=0;i--){
        curr=(curr+(s[i]-'0')*prev)%k;
        ans+=cnt[curr];
        ++cnt[curr];
        prev=prev*10%k;
    }
    cout<<ans<<endl;
  }


