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<cstdio>
#include<cstring>

#define N 200010

using namespace std;

char s[N];
int ans,mod[2019];

int main()
{
    scanf("%s",s+1);
    int len=strlen(s+1);
    mod[0]=1;
    for(int i=len,x=0,cnt=1;i>=1;i--,cnt=cnt*10%2019)
    {
        x=((s[i]-'0')*cnt+x)%2019;
        ans+=mod[x];
        mod[x]++;
    }
    printf("%d\n",ans);
    return 0;
}