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) {
		Scanner sc = new Scanner(System.in);
		
		char[] s = sc.next().toCharArray();
		int N = s.length;
		
		int[] count = new int[2019];
		
		count[0] = 1;
		int mod = 0;
		int base = 1;
		long ans = 0;
		for(int i=N-1; i>=0; i--) {
			mod = (mod + base*(s[i]-'0'))%2019;
			ans += count[mod];
			count[mod]++;
			base = (base*10)%2019;
		}

		System.out.println(ans);
		sc.close();
	}
}
