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);
		String s = sc.next();
		int n = s.length(), p = 2019;
		sc.close();
		long ans = 0;
		Map<Integer, Long> modlist = new HashMap<Integer, Long>();
		long val = 0;
		int m = 1, mode10 = 10 % p;
		for (int i = n - 1; i >= 0; --i) {
			int tmp = (int) (s.charAt(i) - '0');
			tmp %= p;
			tmp *= m;
			tmp %= p;
			val += (long)tmp;
			val %= (long)p;
			int key = (int)val;
			long value = 1;
			if (modlist.containsKey(key))
				value += modlist.get(key);
			modlist.put(key, value);
			ans += (key == 0 ? value : value - 1);
			m *= mode10;
			m %= p;
		}
		System.out.println(ans);
	}
}
