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.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		sc.close();

		int n = s.length;
		int m = 2019;
		int[] p = new int[m];
		p[0] = 1;
		long ans = 0;
		int b = 1;
		int now = 0;
		for (int i = n - 1; i >= 0; i--) {
			int c = s[i] - '0';
			now += c * b;
			now %= m;
			ans += p[now];
			p[now]++;
			b *= 10;
			b %= m;
		}
		System.out.println(ans);
	}
}
