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

public class ElA {
    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int a = Integer.parseInt(in.readLine());
        char[] arr = in.readLine().toCharArray();
        int[] sum = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            sum[i] = arr[i] - '0';
            if (i > 0)
                sum[i] += sum[i - 1];
        }
        int[] count = new int[(arr.length + 2) * 9];
        long ways = 0;
        for (int i = 0; i < arr.length; i++) {
            int r = (i > 0) ? sum[i - 1] : 0;
            for (int j = i; j < arr.length; j++) {
                count[sum[j] - r]++;
                ways++;
            }
        }
        if (a == 0) {
            long x = count[0];
            long result = 2 * x * ways - x * x;
            System.out.println(result);
        } else {
            long result = 0;
            for (int i = 1; i * i <= a; i++) {
                if (a % i == 0) {
                    if (i >= count.length || a / i >= count.length)
                        continue;
                    int other = a / i;
                    if (other == i) {
                        long x = count[i];
                        result += x * x;
                    } else {
                        long x = count[i];
                        result += 2 * x * count[a / i];
                    }
                }
            }
            System.out.println(result);
        }
    }
}
