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()
{
	string s; cin >> s;
	int v = 2019 , pow = 1, val = 0;
	int n = s.size();
	map<int,int> m;
	int ans = 0;
	m[0]++;
	for(int i = n-1; ~i; i--){
		int k = s[i]-'0';
		val = (val+(k*pow))%2019;
		ans += m[val];
		m[val]++;
		pow = pow*10%2019;
	}
	cout << ans;
}
