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<cstring>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2e5+5;
char s[N];
int mod[N];
int main(){
cin>>s;
int k=1,res=0,ans=0;
for(int i=strlen(s)-1;i>=0;i--){
    mod[res]++;
    res=(res+(s[i]-'0')*k)%2019;
    ans+=mod[res];
    k=k*10%2019;
}
cout<<ans;


return 0;
}
