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 sys,collections as cc
input = sys.stdin.readline
I = lambda : list(map(int,input().split()))

a,=I()
s=list(map(int,[i for i in input().strip()]))
d=cc.Counter([])
n=len(s)
for i in range(1,n+1):
	su=sum(s[:i])
	for j in range(i,n):
		d[su]+=1
		su=su-s[j-i]+s[j]
	d[su]+=1
an=0
if a==0:
	an=(n*(n+1)//2)**2
	del d[0]
	xx=sum(d.values())
	for i in d:
		an-=d[i]*(xx)
else:
	for i in d.keys():
		if i!=0 and a%i==0:
			an=an+(d[i]*d[a//i])
print(an)