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=input()
b=map(int,list(raw_input()))
l=len(b)
ans=0
count={}
pre=[0]
for i in b:
    pre.append(i+pre[-1])
tot=0
for i in range(1,l+1):
    for j in range(i,l+1):
        x=pre[j]-pre[i-1]
        tot+=1
        count[x]=count.get(x,0)+1

if a==0:
    if count.get(0,-1)==-1:
        print 0
        exit()
    else:
        ans=0
        for i in range(1, l + 1):
            for j in range(i, l + 1):
                x = pre[j] - pre[i - 1]
                if x==0:
                    ans+=(tot)
        #print ans



for i in count:
        if i!=0 and a%i==0:
            c=count.get(a/i,-1)
            if c!=-1:
                ans+=count[i]*c
print ans