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())
s=input()

di = {}
for i in range(len(s)):
    total=0
    for j in range(i, len(s)):
        total += int(s[j])
        di[total] = 1 if total not in di else di[total]+1

ans=0
if a==0:
    ans=0
    if 0 in di:
        ans +=di[0]*di[0]
        for each in di:
            if not each:continue
            ans += di[each]*di[0]*2
    print(ans)
    quit()
for p in di:
    if p and a % p == 0 and (a//p) in di:
        ans += di[a//p]*di[p]
print(ans)