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;

const int M = 2019;
int64_t ans;

int main() {
    string S; cin >> S;
    map<int, int> mp;
    mp[0] = 1;
    int N = S.size(), ten = 1, total = 0;
    for (int i = 0; i < N; i++) {
        total = ((S[N-i-1] - '0') * ten + total) % M;
        ans += mp[total]++;
        ten = ten * 10 % M;
    }
    cout << ans << endl;
}