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)  {

		String s = new Scanner(System.in).next();
		final int REKI = 2019;
		int[][] ans = new int[2][REKI];

		int a = 0;
		for(int i = 0 ; i < s.length() ; i++ ) {
			int temp =Character.getNumericValue(s.charAt(i));;
			for(int j = 0 ; j < REKI ; j++ ) {
				ans[1][(j*10+temp) %REKI] += ans[0][j];
			}
			a+= ans[1][0];
			ans[1][temp] +=1;
			ans[0] = ans[1].clone();
			Arrays.fill(ans[1], 0);
		}

		System.out.println(a);
	}

}