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;
typedef long long ll;
int main()
{
    string s;
    cin>>s;

    vector<int>v(2019);
    v[0]=1;

    int x=0,ans=0,p=1,n=s.size();

    for (int i=n-1; i>=0; --i)
    {
        x+=(s[i]-'0')*p;
        x%=2019;
        ans+=v[x];
        v[x]++;
        p*=10;
        p%=2019;
    }
    cout<<ans;

}
