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(){
	ios::sync_with_stdio(0);
	cout << setprecision(10) << fixed;
	string s;
	cin >> s;
	map<int, int> cnt;
	cnt[0] = 1;
	long long ans = 0, t = 1, cur = 0;
	for (int i = s.size() - 1; i >= 0; --i){
		int now = s[i] - '0';
		cur = (cur + now * t) % 2019;
		ans += cnt[cur]++;
		t = t * 10 % 2019;
	}
	cout << ans;
	return 0;
}

