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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static int maxN = (int) 2e5 + 5;
    public static int mod = 2019;

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s = br.readLine();
        int n = s.length(), x = 0, y = 1;
        int[] cnt = new int[mod];
        for (int i = n - 1; i >= 0; i--) {
            x = (x + (s.charAt(i) - '0') * y) % mod;
            y = y * 10 % mod;
            cnt[x]++;
        }
        long ans = 0;

        for (int i = 1; i < 2019; i++) {
            if (cnt[i] > 1) {
                ans += (long) (cnt[i] - 1 + 1) * (cnt[i] - 1) / 2;
            }
        }
        ans += (long) cnt[0] * (cnt[0] + 1) / 2;

        System.out.println(ans);

    }
}
