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

public class P364A
{
	public static void main(String[] args)
	{
		Scanner scan = new Scanner(System.in);
		int a = scan.nextInt();
		char[] s = scan.next().toCharArray();
		for (int i = 0; i < s.length; i++)
			s[i] -= '0';
		HashMap<Integer, Integer> map = new HashMap<>();
		for (int i = 0; i < s.length; i++)
		{
			int sum = 0;
			for (int j = i; j < s.length; j++)
			{
				sum += s[j];
				Integer occ = map.get(sum);
				if (occ == null)
					map.put(sum, 1);
				else
					map.put(sum, occ+1);
			}
		}
		long ans = 0;
		for (int i = 0; i < s.length; i++)
		{
			int sum = 0;
			for (int j = i; j < s.length; j++)
			{
				sum += s[j];
				if (sum == 0 && a == 0)
					ans += (s.length)*(s.length+1)/2;
				else if (sum != 0 && a % sum == 0)
				{
					Integer occ = map.get(a/sum);
					if (occ != null)
						ans += occ;
				}
			}
		}
		System.out.println(ans);
	}
}
