You have a string of decimal digits s. Let's define bij = si·sj. Find in matrix b the number of such rectangles that the sum bij for all cells (i, j) that are the elements of the rectangle equals a in each rectangle.

A rectangle in a matrix is a group of four integers (x, y, z, t) (x ≤ y, z ≤ t). The elements of the rectangle are all cells (i, j) such that x ≤ i ≤ y, z ≤ j ≤ t.

Input

The first line contains integer a (0 ≤ a ≤ 109), the second line contains a string of decimal integers s (1 ≤ |s| ≤ 4000).

Output

Print a single integer — the answer to a problem.

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples

Input

10
12345


Output

6


Input

16
439873893693495623498263984765


Output

40
import java.io.*;
import java.util.*;

public class ProblemC {

  
  public static void main(String[] args) throws Exception {
    Scanner in = new Scanner(System.in);
    
    long a = in.nextInt();
    
    char c[] = in.next().toCharArray();

    int n = c.length;
    
    int val[] = new int[n];
    
    for (int i = 0; i < n; i++) {
      val[i] = c[i] - '0';
    }
    
    int f[] = new int[n];
    f[0] = val[0];
    for (int i = 1; i < f.length; i++) {
      f[i] = f[i-1] + val[i];
    }
    
    long count[] = new long[40000];
    
    for (int i = 0; i < n; i++) {
      for (int j = i; j < n; j++) {
        int sum = f[j];
        if(i > 0)
          sum -= f[i-1];
        count[sum]++;
      }
    }
//    System.out.println(Arrays.toString(count));
    long result = 0;
    
    for (long i = 1; i*i <= a; i++) {
      if(a % i == 0){
        long div1 = i;
        long div2 = a/i;
        
        if(div1 >= count.length || div2 >= count.length){
          continue;
        }
        
        long r = count[(int)div1]*count[(int)div2];
        if(div1 != div2){
          result += 2*r;
        }
        else {
          result += r;
        }
      }
    }
    
    long total = 0;
    for (int i = 1; i < count.length; i++) {
      total += count[i];
    }
//    System.out.println(count[0]);
//    System.out.println(total);
    if(a == 0){
      result = 2*count[0]*total + count[0]*count[0]; 
    }
    
    System.out.println(result);
  }
  
  
}
