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.util.*;
public class Matrix {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        String s = in.next();
        int[] freq = new int[36001];
        for (int i = 0; i < s.length(); i++) {
            int sum = 0;
            for (int j = i; j < s.length(); j++) {
                sum += s.charAt(j) - '0';
                freq[sum]++;
            }
        }
        long ans = 0;
        for (int i = 0; i < s.length(); i++) {
            int sum = 0;
            for (int j = i; j < s.length(); j++) {
                sum += s.charAt(j) - '0';
                if(a > 0){
                    if(sum > 0){
                        if(a / sum < 36001 && a % sum == 0){
                            ans += freq[a / sum];
                        }
                    }
                }else{
                    if(sum == 0){
                        ans += s.length() * (s.length() + 1) / 2;
                    }else{
                        ans += freq[0];
                    }
                }
            }
        }
        System.out.println(ans);
    }
}
