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
#include <bits/stdc++.h>
using namespace std;

int main()
{
	vector<long long> dp(2020, 0);
	string s;
	cin >> s;
	int len = s.length();
	long long cnt = 0;
	for(int i = 0; i < len; i++) {
		vector<long long> new_dp(2020, 0);
		dp[0] += 1;
		for(int j = 0; j < 2019; j++) {
			new_dp[((j*10)+s[i]-'0')%2019] += dp[j];
		}
		dp = new_dp;
		cnt += dp[0];
	}
	printf("%lld\n", cnt);
}