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 {
        Scanner sc = new Scanner(System.in);
        int p = 2019;
        char[] s = sc.next().toCharArray();
        int n = s.length;
        long ans = 0;
        int[] cum = new int[n+1];
        int pow = 1;
        for(int i = n-1; i >= 0; i--){
            int tmp = ((s[i] - '0') * pow) % p;
            cum[i] = (cum[i+1]+tmp) % p;
            pow *= 10;
            pow %= p;
        }
        int[] counter = new int[p];
        for(int i = n; i >= 0; i--){
            ans += counter[cum[i]];
            counter[cum[i]]++;
        }
        System.out.println(ans);
    }
}
