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
def main():
	a = input()
	s = map(int, raw_input())
	n = len(s)
	dp = [0] * (n + 1)
	for i in xrange(n): dp[i + 1] = dp[i] + s[i]
	cnt = [0] * (n * 9 + 1)
	for index, right in enumerate(dp):
		for left in dp[0:index]:
			cnt[right - left] += 1
	if 0 == a:
		print cnt[0] * n * (n + 1) - cnt[0]* cnt[0]
	else:
		ans = 0
		for i in xrange(1, len(cnt)):
			if 0 == a % i and a / i < len(cnt):
				ans += cnt[i] * cnt[a / i]
		print ans

main()
