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;
long i, c=0, t=10, ans=0, N=S.size(); vector<long> R(N); 
R[N-1]=S[N-1]-'0';
for(i=N-2; i>=0; i--){ 
  R[i]=(t*(S[i]-'0')+R[i+1])%2019; t=(10*t)%2019;
  if(R[i]==0){ ans++; }
}
sort(R.begin(), R.end());
for(i=0; i<N; i+=c, c=0){
while(i+c<N&&R[i]==R[i+c]){ c++; }
ans+=c*(c-1)/2;
}
cout << ans << "\n";
}