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

int m = 0, t = 0, w, u = 1;
string s;
int a[2020];

int main()
{
	cin >> s;

	w = s.size();
	a[0] = 1;

	for (int i = 0; i < w; i++) {
		t = (t + (s[w - 1 - i] - '0') * u) % 2019;
		a[t]++;
		u = u * 10 % 2019;
	}

	for (int i = 0; i < 2019; i++)
		m += a[i] * (a[i] - 1) / 2;

	cout << m << endl;
}