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>
#define ll long long
using namespace std;

int main() {
    string s;
    cin >> s;
    map<ll, ll> mp;
    mp[0] = 1;
    ll cur = 0, p = 1, ans = 0;
    for (int i = s.size() - 1; i >= 0; i--) {
        cur = (cur + (s[i] - '0') * p) % 2019;
        ans += mp[cur];
        p = (p * 10) % 2019;
        mp[cur]++;
    }
    cout << ans << endl;
    return 0;
}