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.lang.reflect.Array;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Input in = new Input(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task task = new Task();
        task.solve(in, out);
        out.close();
    }
}

class Input {
    public BufferedReader bufferedReader;
    private StringTokenizer stringTokenizer;

    public Input(InputStream inputStream) {
        bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
        stringTokenizer = null;
    }

    public String nextString() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(bufferedReader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(nextString());
    }
}

class Task {
    public void solve(Input in, PrintWriter out) throws IOException {
        int a = in.nextInt();
        String s = in.nextString();
        int n = s.length();

        int[][] sum = new int[4001][4001];
        long[] T = new long[9 * n + 1];

        sum[0][0] = s.charAt(0) - '0';
        T[sum[0][0]]++;
        for (int i = 1; i < n; i++) {
            sum[0][i] = sum[0][i - 1] + s.charAt(i) - '0';
            T[sum[0][i]]++;
        }

        for (int i = 1; i < n; i++) {
            for (int j = i; j < n; j++) {
                sum[i][j] = sum[i - 1][j] - (s.charAt(i - 1) - '0');
                T[sum[i][j]]++;
            }
        }

        long ans = 0;
        if (a == 0) {
            if (T[0] == 0) {
                out.println("0");
                return;
            }

            for (int i = 1; i < 9 * n + 1; i++) {
                ans += T[i] * T[0];
            }

            out.println(2 * ans + T[0] * T[0]);
            return;
        }

        for (int i = 1; i < 9 * n + 1; i++) {
            if (i > a) {
                break;
            }

            if (a % i == 0 && a / i < 9 * n + 1) {
                ans += T[i] * T[a / i];
            }
        }

        out.println(ans);
    }
}
