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 <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin>>s;
reverse(s.begin(),s.end());
int m=s.size();
vector<int>cnt(2019);
long long ans=0;
int x=1;
int tot=0;

for(int i=0;i<m;i++)
{
cnt[tot]++;
tot+=(s[i]-'0')*x;
tot%=2019;
ans+=cnt[tot];
x=x*10%2019;

}

cout <<ans;
}