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.Scanner;
public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    // 対象の文字列
    String S = sc.next();

    // 文字列の長さ
    int N = S.length();

    // 文字列の長さの配列を作る
    int A[] = new int[2019];
    A[0] =1;
    int dight = 1;
    long ans = 0;
    int tmp = 0;
    for(int i=N-1; i>=0 ;i--){
      int x = Character.getNumericValue(S.charAt(i));
      tmp=((x*dight)+tmp)%2019;
      ans +=A[tmp];
      A[tmp]++;
      dight = dight * 10 % 2019;
    }
    System.out.print(ans);
  }  
  
}


