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;
typedef long long ll;

const int m = 2019;

int main()
{
	string s;
	cin >> s;
	reverse(s.begin(), s.end());

	ll sum = s[0] - '0';
	vector<ll> cnt(m);
	cnt[0] = 1;
	ll ans = 0;
	ll x = 10;
	for (int i = 1; i < s.size(); i++) {
		cnt[sum]++;
		sum += (s[i] - '0')*x;
		sum %= m;
		x = x * 10 % m;
		ans += cnt[sum];
	}
	cout << ans << endl;
}
