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;

ll cnt[2020], ans;

int main()
{
    string s;
    cin >> s;
    int l = s.length();
    int x = 0; ++cnt[x]; int t = 1;
    for(int i=l-1; i>=0; --i){
        x = (x+(t*(s[i]-'0')))%2019;
        ++cnt[x];
        t = (t*10)%2019;
    }
    for(int i=0; i<2019; ++i) ans += (cnt[i]*(cnt[i]-1))/2;
    cout << ans << endl;
}