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.Scanner;

public class C {

	public static void main(String[] args)  {
		Scanner sc= new Scanner(System.in);
		int a =sc.nextInt();
		String s = sc.next();
		int[]c = new int[s.length()+1];
		for (int i = 1; i <= s.length(); i++) {
			c[i] = s.charAt(i-1)-48;
		}
		int[]cnt = new int[9*s.length()+1];
		int[]sum = new int[s.length()+1];
		long ans = 0;
		for (int i = 1; i <= s.length(); i++) {
			sum[i] = sum[i-1]+c[i];
			for (int j = 1; j <= i; j++) {
				cnt[sum[i]-sum[j-1]]++;
			}
		}
		if (a==0) {
			long ss = 0;
			for (int i = 0; i <= 9*s.length(); i++) {
				ss += cnt[i];
			}
			ans += cnt[0] * ss;
			ans += cnt[0] * ss;
			ans -= (long)cnt[0] * cnt[0];
			System.out.println(ans);
			return;
		}
		for (int i = 1; i*i <= a; i++) {
			if (a % i==0 && a / i <= 9*s.length()) {
				ans += (long)cnt[i] * cnt[a / i];
				if (i*i != a)
					ans += (long)cnt[i] * cnt[a / i];
			}
		}
		System.out.println(ans);
	}

}
