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

public class CodeForces364A {
	public static void main(String[] a) {
		new CodeForces364A().run();
	}

	int MAXN = 4000 + 5;
	Map<Long, Long> cnt = new HashMap<Long, Long>(MAXN * MAXN);
	long[] sum = new long[MAXN];

	public void run() {
		int a;
		String s;
		try (Scanner in = new Scanner(System.in)) {
			a = in.nextInt();
			s = in.next();			
		}
		
		int N = s.length();
		for (int i = 1; i <= N; i++) {
			sum[i] = sum[i - 1] + s.charAt(i - 1) - '0';
		}
		for (int i = 0; i <= N; i++) {
			for (int j = i + 1; j <= N; j++) {
				long b = sum[j] - sum[i];
				Long ret = cnt.get(b);
				if (ret != null) {
					cnt.put(b, ret + 1);
				} else {
					cnt.put(b, 1l);
				}
			}
		}
		long res = 0;
		for (int i = 0; i <= N; i++) {
			for (int j = i + 1; j <= N; j++) {
				long b = sum[j] - sum[i];
				if (b == 0) {
					if (a == 0) {
						res += (N+1)*N/2;
					}
				}
				else if (a % b == 0) {
					long c = a / b;
					Long ret = cnt.get(c);
					if (ret != null) {
						res += ret;
					}
				}
			}
		}
		System.out.println(res);
	}
}
