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
a=int(input())
b=[int(i) for i in input()]
n=len(b)
c=[0]*(sum(b)+1)
d=[0]
e=0
for i in range(n):
    e+=b[i]
    d.append(e)
for i in range(n):
    for j in range(i,n):
        c[d[j+1]-d[i]]+=1
if a==0:
    print(2*c[0]*sum(c)-c[0]**2)
else:
    f=0
    c1=len(c)
    for i in range(1,int(a**0.5)+1):
        if a%i==0 and i<c1 and a//i<c1:
            f+=c[i]*c[a//i]
            if i!=a//i:
                f+=c[a//i]*c[i]
    print(f)