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
#include <bits/stdc++.h>
using namespace std;
int dem[36000];
int a, n;
char s[4040];
long sum[4040];
int main() {
  memset(dem, 0, sizeof(s));
  scanf("%ld\n", &a);
  gets(s);
  n = strlen(s);
  sum[0] = 0;
  long long res = 0;
  for (int i = 0; i <= n - 1; i++) sum[i + 1] = sum[i] + (s[i] - 48);
  for (int i = 0; i <= n - 1; i++)
    for (int j = i + 1; j <= n; j++) dem[sum[j] - sum[i]]++;
  for (int i = 1; i <= 9 * n; i++)
    if ((a % i == 0) && (a / i <= 9 * n)) {
      res += ((long long)dem[i]) * dem[a / i];
    }
  if (a == 0) res = res * 2 + ((long long)dem[0]) * dem[0];
  printf("%I64d", res);
  return 0;
}
