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
from collections import defaultdict
a=int(input())
s=list(input())
n=len(s)
for i in range(n):
  s[i]=int(s[i])
cs=[0]+s
for i in range(1,n+1):
  cs[i]+=cs[i-1]
cnt=defaultdict(int)
key=set()
for l in range(1,n+1):
  for r in range(l,n+1):
    cnt[cs[r]-cs[l-1]]+=1
    key.add(cs[r]-cs[l-1])
if a==0:
  if 0 in cnt:
    y=n*(n+1)//2
    print(y*cnt[0]+cnt[0]*(y-cnt[0]))
  else:
    print(0)
  exit()
ans=0
for x in key:
  if x>0 and a%x==0 and a//x in key:
    ans+=cnt[x]*cnt[a//x]
print(ans)