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.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.nextLine();
		int n = str.length(), tmp;
		long[] bef = new long[2019], aft = new long[2019];
		long ans = 0;
		for(int i = 0; i < n; i++){
			tmp = str.charAt(i)-'0';
			aft[tmp]++;
			for(int k = 0; k < 2019; k++){
				aft[(k*10+tmp)%2019] += bef[k];
			}
			ans += aft[0];
			for(int j = 0; j < 2019; j++){
				bef[j] = aft[j];
			}
			Arrays.fill(aft, 0);
		}
		System.out.println(ans);
	}
}
