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>
#include<algorithm>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)


#define INF 1000000000000


signed main()
 {
string s;
cin>>s;
vector<int>a(2019);
int t=1;
int c=0;
a[c]++;
rep(i,s.size()){
  c=(c+(s[s.size()-i-1]-'0')*t)%2019;
  t=(t*10)%2019;
  a[c]++;
}
int ans=0;
rep(i,2019){ans+=a[i]*(a[i]-1)/2;}
cout<<ans;
}
