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 {

  static Scanner scan = new Scanner(System.in);

  public static void main(String[] args) {
    String s = scan.next();

    Map<Integer, Integer> modToCount = new HashMap<>();
    int curMod = 0;
    int tenthMod = 0;
    int m = 2019;

    long count = 0;

    for (int i = s.length() - 1; i >= 0; i--) {
      int digit = s.charAt(i) - '0';

      if (i == s.length() - 1) {
        tenthMod = 1;
      }
      else {
        tenthMod = (tenthMod * 10) % m;
      }
      curMod = (curMod + digit * tenthMod) % m;

      if (curMod == 0) {
        count++;
      }

      if (modToCount.containsKey(curMod)) {
        count += modToCount.get(curMod);
      }

      // System.out.println(digit +" " + count);

      if (modToCount.containsKey(curMod)) {
        modToCount.put(curMod, modToCount.get(curMod) + 1);
      }
      else {
        modToCount.put(curMod, 1);
      }
    }

    System.out.println(count);
  }
}
