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.Arrays;
import java.util.Scanner;
 
public class Matrix 
{
	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		
		long sum[] = new long[36001];
		
		int target = sc.nextInt();
		String s = sc.next();
		
		int cur = 0;
		long it = 0;
		for(int l = 0; l < s.length(); l++)
		{
			cur = 0;
			for(int r = l; r < s.length(); r++)
			{
				cur += s.charAt(r) - '0';
				sum[cur]++;
				it++;
			}
		}
		
		long r = 0;
		for(int i = 0; i <= 36000; i++)
		{
			if(i == 0)
			{
				if(sum[i] > 0 && target == 0)
				{
					for(int j = 0; j <= 36000; j++)
					{
						r += sum[i] * sum[j];
					}
				}
			}
			else if(sum[i] > 0 && target%i == 0)
			{
				int pair = target/i;
				if(pair <= 36000)
					r += sum[i] * sum[pair];
			}
		}
		
		
		System.out.println(r);
	}
 
}