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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CF_364A solver = new CF_364A();
        solver.solve(1, in, out);
        out.close();
    }

    static class CF_364A {
        public void solve(int testNumber, Scanner input, PrintWriter out) {
            ShortScanner in = new ShortScanner(input);
            int a = in.i();
            char[] c = in.c();
            int n = c.length;
            int[] b = new int[n];
            for (int i = 0; i < n; ++i) b[i] = c[i] - '0';

            int[][] sum = new int[n][n];
            int[] f = new int[9 * n + 1];
            int zero = 0;
            for (int i = 0; i < n; ++i) {
                for (int j = i; j < n; ++j) {
                    if (j > i)
                        sum[i][j] = sum[i][j - 1] + b[j];
                    else
                        sum[i][j] = b[j];
                    f[sum[i][j]]++;
                    zero++;
                }
            }

            long ans = 0;
            for (int i = 0; i < n; ++i) {
                for (int j = i; j < n; ++j) {
                    if (sum[i][j] > 0 && a % sum[i][j] == 0 && a / sum[i][j] <= 9 * n) {
                        if (f[a / sum[i][j]] > 0)
                            ans += f[a / sum[i][j]];
                    }
                    else if (sum[i][j] == 0 && a == 0) {
                        ans += zero;
                    }
                }
            }

            out.println(ans);
        }

        class ShortScanner {
            Scanner in;

            ShortScanner(Scanner in) {
                this.in = in;
            }

            int i() {
                return in.nextInt();
            }

            char[] c() {
                return in.next().toCharArray();
            }

        }

    }
}
