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<stdio.h>
#include<string.h>
int main(void)
{
  int i=0;
  char S[200001];
  long long a=0,d=1LL,x=0,count[2019]={1LL};
  i=scanf("%s",S);i=strlen(S);
  while(i--){x=(x+(S[i]-'0')*d)%2019;a+=count[x]++;d=d*10%2019;}
  return printf("%lld\n",a),0;
}