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.util.Scanner;


public class CodeForces213C_Matrix {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        input.nextLine();
        String s = input.next();
        int n = s.length();
        
        int [] cum = new int[n];
        cum[0] = s.charAt(0) - '0';
        for (int i = 1; i < n; i++) {
            cum[i] = cum[i - 1] + (s.charAt(i) - '0');
//          System.out.print(cum[i] + " ");
        }
        
        // segmentCount[i] stores how many segments (l,r) are such that
        // s_l + s_{l+1} + ... + s_r = i
        int [] segmentCount = new int[9 * n + 1]; 
        
        for (int i = 0; i < n; i++) {
            int left = (i > 0) ? cum[i - 1] : 0;
            for (int j = i; j < n; j++) {
                int segmentSum = cum[j] - left;
                segmentCount[segmentSum]++;
            }
        }
        long ans = 0;
        
        if (a == 0) {
            long zeroCount = (long) segmentCount[0];
            ans = 2 * (n+1) * n / 2 * zeroCount - zeroCount * zeroCount;
        } else {
            double upperbound = Math.min(a, 9 * n);
            for (int i = (int) Math.ceil(a / upperbound); i <= upperbound; i++) {
                if (a % i != 0) continue;
                //System.out.print("At i = " + i);
                ans += (long) segmentCount[i] * segmentCount[a / i];
            }
//          System.out.println();
        }
        
        System.out.println(ans);
        
        input.close();
    }
    
}