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

public class R213a {
    private static int MAXS = 4000*9 + 1;
    public static void main(String[] args) {
        int sum, i, j;
        long sol = 0;
        long fr[] = new long[MAXS];
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        char s[] = in.next().toCharArray();
        int n = s.length;
        for(i = 0; i < n; i++)
            for(j = i, sum = 0; j < n; j++)
            {
                sum += s[j] - '0';
                fr[sum]++;
            }
        int r = (int)Math.sqrt((double)a);
        for(i = 1; i <= r; i++)
        if(a%i == 0 && a/i < MAXS)
        {
            sol += fr[i]*fr[a/i];
            if(i*i != a) sol += fr[i]*fr[a/i];
        }
        if(a == 0)
        {
            for(i = 1; i < MAXS; i++)
                sol += 2L*fr[0]*fr[i];
            sol += fr[0]*fr[0];
        }
        System.out.println(sol);
    }
}
