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.*;

public class P364A {
    private static void increment(HashMap<Integer, Integer> count, int key) {
        if (!count.containsKey(key)) {
            count.put(key, 0);
        }
        count.put(key, count.get(key) + 1);
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        String str = sc.next();
        int N = str.length();
        int[] s = new int[N];
        for (int i = 0; i < N; i++) {
            s[i] = str.charAt(i) - '0';
        }
        int[] ps = new int[N];
        ps[0] = s[0];
        for (int i = 1; i < N; i++) {
            ps[i] = s[i] + ps[i-1];
        }
        
        int[][] b = new int[N][N];
        HashMap<Integer, Integer> count = new HashMap<Integer, Integer>();
        for (int j = 0; j < N; j++) {
            b[0][j] = ps[j];
            increment(count, b[0][j]);
        }
        for (int i = 1; i < N; i++) {
            for (int j = i; j < N; j++) {
                b[i][j] = ps[j] - ps[i-1];
                increment(count, b[i][j]);
            }
        }
        
        long result = 0;
        if (a != 0) {
            for (int i = 0; i < N; i++) {
                for (int j = i; j < N; j++) {
                    if (b[i][j] != 0 && a % b[i][j] == 0) {
                        int key = a / b[i][j];
                        if (!count.containsKey(key)) continue;
                        result += count.get(key);
                    }
                }
            }
        } else {
            for (int i = 0; i < N; i++) {
                for (int j = i; j < N; j++) {
                    if (b[i][j] == 0) {
                        result += N * (N + 1) - count.get(0);
                    }
                }
            }
        }
        
        System.out.println(result);
    }
}
        