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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeMap;


public class A {

    static StringTokenizer st;
    static BufferedReader br;
    static PrintWriter pw;
    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        int k = nextInt();
        String s = next();
        int n = s.length();
        int[]a = new int[n+1];
        for (int i = 1; i <= n; i++) {
            a[i] = s.charAt(i-1)-48;
        }
        long ans = 0;
        int[]cnt = new int[9*n+1];
        int[]sum = new int[n+1];
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i-1]+a[i];
            for (int j = 1; j <= i; j++) {
                cnt[sum[i]-sum[j-1]]++;
            }
        }
        if (k==0) {
            long ss = 0;
            for (int i = 0; i <= 9*n; i++) {
                ss += cnt[i];
            }
            ans += cnt[0] * ss;
            ans += cnt[0] * ss;
            ans -= (long)cnt[0] * cnt[0];
            System.out.println(ans);
            return;
        }
        for (int i = 1; i*i <= k; i++) {
            if (k % i==0 && k / i <= 9*n) {
                ans += (long)cnt[i] * cnt[k / i];
                if (i*i != k)
                    ans += (long)cnt[i] * cnt[k / i];
            }
        }
        System.out.println(ans);
        pw.close();
    }
    private static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    private static long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    private static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    private static String next() throws IOException {
        while (st==null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }
}
