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 <cstring>
using namespace std;
const int maxn = 200010;
int main()
{
	char s[maxn];
	int mp[maxn] = { 0 }, ans = 0;
	cin >> s;
	int len = strlen(s);
	mp[0] = 1;
	int x = 0, cnt = 1;
	for (int i = len - 1; i >= 0; i--)
	{
		x = ((s[i] - '0') * cnt + x) % 2019;
		ans += mp[x];
		mp[x]++;
		cnt = cnt * 10 % 2019;
	}
	cout << ans << endl;
	return 0;
}