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

public class C {
	public static void main(String [] args){
		final Scanner s = new Scanner(System.in);
		final int a = s.nextInt();
		final String digits = s.next();
		final int n = digits.length();
		final int [] sum = new int[n + 1];
		for (int i = 1; i <= n; ++i){
			sum[i] = sum[i - 1] + (digits.charAt(i - 1) - '0');
		}
		final long [] counters = new long[9*n + 1];
		for (int i = 0; i < n; ++i){
			for (int j = i + 1; j <= n; ++j){
				counters[sum[j] - sum[i]]++;
			}
		}
		long res = 0;
		if (a == 0){
			for (int i = 1; i < counters.length; ++i){
				res += counters[i];
			}
			res *= 2*counters[0];
			res += counters[0]*counters[0];
		}else{
			for (int i = 1; i < counters.length; ++i){
				if (a%i == 0){
					final int left = a/i;
					if (left >= counters.length){
						continue;
					}
					res += counters[i]*counters[(int)left];
				}
			}			
		}
		System.out.println(res);
		s.close();
	}
}
