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;

int main() {
	string S;
	cin >> S;
	reverse(S.begin(), S.end());
	int n = S.size();
	vector<int>mod(2019);
	int now = 0;
	int ans = 0;
	int ten = 1;
	mod[0] = 1;
	for (int m = 0;m < n; ++m) {
		now += (S[m] - '0')*ten;
		now %= 2019;
		ans += mod[now];
		//cout << now << endl;
		mod[now]++;
		ten = (ten * 10) % 2019;
	}
	cout << ans <<endl;
	return 0;
}