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;
const int maxn = 4005;
char a[maxn];
int s[maxn];
int q[maxn * maxn];
int n, m, t;
long long ans;
int main() {
  int i, j;
  scanf("%d", &m);
  scanf("%s", a);
  n = strlen(a);
  for (i = 1; i <= n; ++i) s[i] = s[i - 1] + a[i - 1] - '0';
  for (i = 1; i <= n; ++i)
    for (j = i; j <= n; ++j) q[t++] = s[j] - s[i - 1];
  sort(q, q + t);
  q[t] = 1 << 30;
  for (i = 0; i < t; ++i)
    if (q[i] > m)
      break;
    else if (q[i] == 0) {
      if (m == 0) ans += 2 * (t - i - 1) + 1;
    } else if (m % q[i] == 0) {
      ans +=
          (upper_bound(q, q + t, m / q[i]) - lower_bound(q, q + t, m / q[i]));
    }
  printf("%I64d\n", ans);
  return 0;
}
