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;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Matrix {

    public static void main(String[] args) {
        Matrix exec = new Matrix();

        exec.solve();
    }

    public void solve() {
        int a;
        String s;
        Scanner sc = new Scanner(System.in);

        a = sc.nextInt();
        s = sc.next();

        solve(a, s);

        sc.close();
    }

    public void solveBufferedInput() {
        int a;
        String s;
        BufferedReader br;

        try {
            br = new BufferedReader(new InputStreamReader(System.in));

            a = Integer.parseInt(br.readLine());
            s = br.readLine();

            solve(a, s);
            br.close();
        } catch(Exception e) {
            e.printStackTrace();
        }

    }

    public void solve(int A, String s) {
        long count = 0;
//        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        Map<Long, Long> map = new HashMap<Long, Long>();
        int[] sumup = new int[s.length()+1];

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

        for (int i=0; i<s.length(); i++) {
            for (int j=i; j<s.length(); j++) {
                long entry = sumup[j+1] - sumup[i];
                Long val;

                if ((val = map.get(entry)) == null) {
                    map.put(entry, (long)1);
                } else {
                    map.put(entry, val + 1);
                }

            }
        }

        if (A != 0) {
            for (int a=1; a*a<=A; a++) {
                Long valA; // for map.get(a)
                Long valAA; // for map.get(A/a)

                if (A%a != 0) continue;
                else if ((valA = map.get((long) a)) == null) continue;
                else if ((valAA = map.get((long) A/a)) == null) continue;

                long tmpCount = valA * valAA;
                count += a*a == A ? tmpCount : 2*tmpCount;
            }
        } else {
            Long val0;
            if ((val0 = map.get((long) 0)) != null) {
                int comb = s.length() * (s.length() + 1) / 2;
                count = val0 * (2*comb - val0);
            }
        }

        System.out.println(count);
    }
}

