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;
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
typedef long long int ll;
ll  ans = 0, h = 1, now = 0;
int main() {
    string s; cin >> s;
    vector<int> as(2020, 0); as[0]++;
    rrep(i, s.size()) {
        now = (now + (s[i] - '0') * h) % 2019;
        h = h * 10 % 2019;
        ans += as[now];
        as[now]++;
    }cout << ans << endl;
}
