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

public class Matrix {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		String s = sc.next();
		int sum[] = new int[s.length()];
		sum[0] = s.charAt(0) - '0';
		for (int i = 1; i < s.length(); i++) {
			sum[i] = sum[i - 1] + (s.charAt(i) - '0');
		}

		int count[] = new int[9 * s.length() + 5];
		// ArrayList<Integer> list = new ArrayList<Integer>();
		for (int i = 0; i < s.length(); i++) {
			for (int j = i; j < s.length(); j++) {
				int isum = sum[j];
				if (i > 0) {
					isum -= sum[i - 1];
				}
				// list.add(isum);
				count[isum]++;
			}
		}
		long ans = 0;
		// if (a == 0) {
		// System.out.println(count[0]);
		// return;
		// }
		for (int isum = 1; isum < count.length; isum++)
			// if (isum > 0) {
			if (a == 0 || (a % isum) == 0)
				if ((a / isum) < count.length && isum < count.length) {
					ans += (long)(count[isum]) * (long)(count[a / isum]);
				}
		// }
		if (a == 0) {
			ans *= 2;
			ans += (long)(count[0]) *(long)( count[0]);
		}
		System.out.println(ans);
	}

}
