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;
typedef pair<ll,ll> P;
int main()
{
	map<ll,ll> mp;
	ll res = 0,ans=0,p=1;
	mp[0]++;
	string s;
	cin>>s;
	for(int i=s.size()-1;i>=0;i--)
	{
		res = ((s[i]-'0')*p+res)%2019;
		ans+=mp[res];
		mp[res]++;
		p = (p*10)%2019;
	}
	cout<<ans<<endl;
	return 0;
}