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
//package codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Random;
import java.util.StringTokenizer;

public class A {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(System.out);
    StringTokenizer stringTokenizer;

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(reader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    void solve() throws IOException {
        int a = nextInt();
        char[] s = reader.readLine().toCharArray();
        int[] p = new int[s.length + 1];
        for(int i = 1; i <= s.length; i++) {
            p[i] = p[i - 1] + s[i - 1] - '0';
        }
        int[] cnt = new int[10 * s.length];
        for(int i = 0; i < p.length; i++) {
            for(int j = i + 1; j < p.length; j++) {
                cnt[p[j] - p[i]]++;
            }
        }
        long ans = 0;
        for(int i = 1; i < cnt.length; i++) {
            if(a % i == 0 && a / i < cnt.length) {
                ans += 1L * cnt[i] * cnt[a / i];
            }
        }
        if(a == 0) {
            int z = cnt[0];
            int l = s.length;
            ans = 1L * z * (l + 1) * l - 1L * z * z;
        }
        writer.println(ans);
        writer.flush();
        writer.close();
    }

    public static void main(String[] args) throws IOException {
        new A().solve();
    }
}
