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 sys
import itertools as it
import bisect as bi
import math as mt
import collections as cc
import sys

I=lambda:list(map(int,input().split()))
a,=I()
s=list(input().strip())
n=len(s)
s=[int(s[i]) for i in range(len(s))]
f=cc.defaultdict(int)
for i in range(n):
	tem=0
	for j in range(i,n):
		tem+=s[j]
		f[tem]+=1
temp=list(f.keys())
if a==0:
	tot=n*(n+1)//2
	tot=tot**2
	if f[0]:
		del f[0]
	tem=sum(f.values())
	for i in f:
		tot-=(tem*f[i])
	print(tot)

else:

	ans=0
	for i in temp:
		if i!=0:

			if a%i==0:
				j=a//i
				if f[i]>0 and f[j]>0:
					ans+=f[i]*f[j]


	print(ans)