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) {
		String S = new Scanner(System.in).next();
		int N = S.length();
		int ans = 0;
		int[][] dp = new int[2][2019];
		for(int i = 0; i < N; i++) {
			int s = Character.getNumericValue(S.charAt(i));
			dp[1][s] = 1;
			for(int j = 0; j < 2019; j++)
				dp[1][(j*10+s)%2019] += dp[0][j];
			ans += dp[1][0];
			dp[0] = dp[1].clone();
			Arrays.fill(dp[1], 0);
		}
		System.out.println(ans);
	}

}
