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;
char x[4500];
long long int a, s[4500];
long long int v[4500 * 4500], nv = 0;
int main() {
  cin >> a >> x;
  int len = strlen(x);
  s[0] = x[0] - '0';
  for (int i = 1; i < len; ++i) {
    s[i] = s[i - 1] + x[i] - '0';
  }
  if (a == 0) {
    long long int nzero = 0, all = 0;
    for (int i = 0; i < len; ++i) {
      for (int j = i; j < len; ++j) {
        long long t = s[j] - s[i] + x[i] - '0';
        if (t == 0) ++nzero;
        ++all;
      }
    }
    cout << (all - nzero) * nzero + nzero * all << "\n";
    return 0;
  }
  for (int i = 0; i < len; ++i) {
    for (int j = i; j < len; ++j) {
      long long t = s[j] - s[i] + x[i] - '0';
      if (t == 0 || a % t) continue;
      v[nv++] = t;
    }
  }
  sort(v, v + nv);
  long long int cnt = 0;
  for (int i = 0; i < nv; ++i) {
    if (a % v[i] == 0) {
      long long r = a / v[i];
      cnt += upper_bound(v, v + nv, r) - lower_bound(v, v + nv, r);
    }
  }
  cout << cnt << endl;
  return 0;
}
