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 <map>
using namespace std;

int main() {
	string s;
	cin >> s;
	map<int, int> suffix;
	++suffix[0];
	int power = 1, cur = 0, m = 2019, n = s.size();
	long long answer = 0;
	for(int i = n - 1; ~i; --i) {
		cur = (cur + (s[i] - '0') * power) % m;
		answer += suffix[cur];
		++suffix[cur];
		power = power * 10 % m;
	}
	cout << answer;
}
