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
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String s = sc.next();
    sc.close();
    int n = s.length();
    StringBuffer sb = new StringBuffer(s);
    String reverse = sb.reverse().toString();

    int digit = 1; // mod2019
    int sum = 0; // mod2019
    int mod = 2019;
    int remains[] = new int[mod];
    Arrays.fill(remains, 0);
    int res = 0;
    for (int i = 0; i < n; i++) {
      remains[sum]++;
      int a = Character.getNumericValue(reverse.charAt(i));
      sum = (sum + a*digit) % mod;
      digit = digit*10 % mod;
      res += remains[sum]; // 自分より小さくmod2019が等しい数(すなわちremains[sum])がペアになる
    }
    System.out.println(res);
  }
}