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 []cnt= new int[2019];
        int x=1;
        int  tat=0;
        long ans=0;
        long m =2019;
        cnt[0]++;
        int n=S.length();

        for(int i=S.length()-1;i>=0;i--)
        {
          int num=(S.charAt(i)-'0');

          tat+=num*x;
          tat%= 2019;

          cnt[tat]++;
          x=x*10;
          x=x%2019;
        }

        for(int i=0;i<2019;i++)
        {if(cnt[i]!=1){
         
          ans+=(cnt[i]*(cnt[i]-1))/2;

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