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 Main {
    public static void main(String args[]) throws Exception {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        String s = sc.next();
        int[] nums = new int[s.length()];
        for(int i = 0; i < nums.length; i++)
        	nums[i] = s.charAt(i) - '0';

        long[] cnt = new long[40001];
        for(int i = 0; i < nums.length; i++){
        	int sum = 0;
        	for(int j = i; j < nums.length; j++) {
        		sum += nums[j];
        		cnt[sum]++;
        	}
        }

        long count = 0;
        if(a == 0) {
        	for(int i = 0; i < cnt.length; i++)
        		count += cnt[i] * cnt[0];
        }
        for(int i = 1; i < cnt.length; i++) {
        	if(a % i == 0 && a / i <= cnt.length) {
        		count += cnt[i] * cnt[a / i];
        	}
        }

        System.out.println(count);
    }
}
