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(raw_input())
s = str(raw_input())
digits = [0 for _ in range(len(s))]
for i in range(len(s)):
    digits[i] = int(s[i])
n = len(s)
prefix = [0 for _ in range(len(s) + 1)]
for i in range(len(s)):
    prefix[i + 1] = digits[i] + prefix[i]

# prefix[i] is the sum of the first i digits of s

from collections import Counter
c = Counter()
for i in range(1, n + 1):
    for j in range(i, n + 1):
        # get sum of ith digit to jth digit inclusive
        # increase count
        c[prefix[j] - prefix[i - 1]] += 1

total = 0
for i in range(1, n + 1):
    for j in range(i, n + 1):
        s = prefix[j] - prefix[i - 1]
        if a == 0:
            if s == 0:
                total += (n * (n-1))/2 + n
            else:
                total += c[0]
        elif s == 0:
            continue
        elif a % s == 0:
            rem = a / s
            total += c[rem]
print total
