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>

char s[200200];
long long p[2019],q[2019],a;

int main()
{
  scanf ("%s",s);
  for (int i=0;s[i];i++){
    for (int j=0;j<2019;j++) p[j] = q[j], q[j] = 0; p[0]++;
    for (int j=0;j<2019;j++) q[(j*10+s[i]-'0')%2019] += p[j];
    a += q[0];
  }
  printf ("%lld\n",a);
  return 0;
}
