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
import os, sys, atexit
range = xrange
from cStringIO import StringIO as BytesIO
sys.stdout = BytesIO()
atexit.register(lambda: os.write(1, sys.stdout.getvalue()))
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline

from sys import stdin

rstr = lambda: input().strip()

a, s, mem = int(input()), rstr(), [0] * (36001)
ls, ans = len(s), 0

for i in range(ls):
    su, c = 0, 0
    for j in range(i + 1):
        su += int(s[j])
    mem[su] += 1

    for j in range(i + 1, ls):
        su -= int(s[c])
        su += int(s[j])
        mem[su] += 1
        c += 1

for i in range(1, 36001):
    try:
        if a % i == 0:
            ans += mem[i] * mem[a // i]
    except:
        continue

if not a:
    ans = ans * 2 + (mem[0] * mem[0])
print(ans)
