364_A. Matrix
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
```python
a = int(input())
s = input()
d = {}
for i in range(len(s)):
    for j in range(i, len(s)):
        if j == i: t = int(s[j])
        else: t += int(s[j])
        d[t] = d.get(t, 0) + 1
if a == 0:
    if 0 in d:
        cnt_pairs = (len(s) * (len(s) + 1)) // 2
        print((d[0] * cnt_pairs) + (d[0] * (cnt_pairs - d[0])))
    else:
        print(0)
else:
    c = 0
    for f in d:
        if f != 0  and a % f == 0 and (a//f) in d:
            c += d[f] * d[a//f]
    print(c)
```