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 A364 {
	static int a, n, digits[], sum[][], frq[];
	static String s;
	static long count;
	
	public static void main(String[] args) {		
		Scanner in = new Scanner(System.in);
		a = in.nextInt();
		s = in.next();
		n = s.length();
		
		digits = new int[n];
		sum = new int[n][n];
		frq = new int[11 * 4001];
		
		for (int i = 0; i < n; i++)	digits[i] = s.charAt(i) - '0';
		
		for (int i = 0; i < n; i++) {
			sum[i][i] = digits[i];
			frq[sum[i][i]]++;
		}
		
		for (int i = 0; i < n; i++) {
			for (int j = i + 1; j < n; j++) {
				sum[i][j] = sum[i][j-1] + digits[j];
				frq[sum[i][j]]++;
			}
		}
		
		
		if (a == 0) {
			count = (long)  frq[0] * (n * n + n) - (long) frq[0] * frq[0];
		} else {
			for (int f = 1; f * f < a; f++) {
				if (a % f == 0 && f < frq.length && a/f < frq.length)
					count += 2L * (long) frq[f] * frq[a/f];
			}
			int sqrt = (int) (Math.round(Math.sqrt(a)));
			if (sqrt * sqrt == a) count += (long) frq[sqrt] * frq[sqrt];
		}
		
		System.out.println(count);
	}	
}
