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
sm = [0] * 40000
n = int(input())
s = input()
l = len(s)
for i in range(l):
    ss = 0
    for j in range(i,l):
        ss += int(s[j])
        sm[ss] += 1


if n == 0:
    ans = 0
    for i in range(1,40000):
        ans += sm[0] * sm[i] * 2
    ans += sm[0]*sm[0]
    print(ans)
else:
    ans = 0
    u = int(n**.5)
    for i in range(1,u+1):
        if n % i == 0:
            if n // i < 40000:
                ans += sm[i] * sm[n//i]
    ans *= 2
    if u ** 2 == n:
        ans -= sm[u] ** 2
    print(ans)
