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.*;
import static java.lang.Math.*;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		
		// 入力
		String s = sc.next();
		
		// 計算
		long result = 0;
		int n = s.length();
		int p = 2019;
		
		int[] sum = new int[n+1];
		int pow = 1;
		for(int i = 0; i < n; i++){
		    sum[i+1] = (sum[i] + (s.charAt(n-1-i)-'0')*pow)%p;
		    pow *= 10;
		    pow %= p;
		}
		int[] cnt = new int[p];
		for(int i = 0; i < n+1; i++){
		    result += cnt[sum[i]];
		    cnt[sum[i]]++;
		}
		
		// 出力
		System.out.println(result);
	}
}
