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 sz=s.size(), t=0, ten=1;
	map<int,int> mp;
	mp[0]=1;
	for(int i=1; i<=sz; ++i){
		int a=stoi(s.substr(sz-i,1));
		a = a*ten;
		t = (t+a)%2019;
		++mp[t];
		ten = ten*10%2019;
	}

	int ans=0;
	for(auto i: mp){
		ans += i.second*(i.second-1)/2;
	}
	
	cout << ans << endl;
}