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>
#define pb push_back
#define sz(v) (v).size()
#define mod 2019
using namespace std;
typedef long long ll;

int num,p=1,cnt[2025];
string s;
ll ans;

int main()
{
	cin>>s;
	for(int i=sz(s)-1;i>=0;i--)
	{
		num+=(s[i]-'0')*p;
		num%=mod;
		p*=10;
		p%=mod;
		cnt[num]++;
	}
	for(int i=0;i<mod;i++)
		ans+=ll(cnt[i])*ll(cnt[i]-1);
	cout<<ans/2+cnt[0]<<endl;
	return 0;
}