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) throws Exception {
        // Your code here!
        Scanner sc = new Scanner(System.in);
        String str = sc.next();
        int p = 2019;
        char c[] = str.toCharArray();
        int n = str.length();
        int[] d = new int[n+1];
        int ten = 1;
        for (int i = n - 1; i >= 0; i--) {
            int a = (c[i] - '0') * ten % p;
            d[i] = (d[i+1]+a) % p;
            ten *= 10;
            ten %= p;
        }
        
        int[] cnt = new int[p];
        long ans = 0;
        for (int i = n; i >= 0; i--) {
            ans += cnt[d[i]];
            cnt[d[i]]++;
        }
        System.out.println(ans);
    }
}
