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 main(){
	string s;
  	cin>>s;
  
  	long long int L=s.size();
  	long long int n=0;
  	long long int p=1;
  	int d[2019]={0};
  	long long int cnt=0;
  	d[0]++;
    for(int i=L-1;i>=0;i--){
        n=(n+(s[i]-'0')*p)%2019;
      	p=(p*10)%2019;
      	cnt+=d[n];
        d[n]++;
    }
	
  	cout<<cnt<<endl;
}
