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 <iostream>
#include <vector>
#include <string>

int main() {
    std::string S;
    std::cin >> S;

    long long ans = 0;

    std::vector<int> v(2019);
    int x = 1, y = 0;
    for (int i = S.size() - 1; i >= 0; i--) {
        y = ((S[i] - '0') * x + y) % 2019;
        ans += y ? v[y]++ : ++v[y];
        x = x * 10 % 2019;
    }
    std::cout << ans << "\n";
}