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 aabs(int a) { return (a < 0) ? -a : a; }
int mmax(int a, int b) { return (a > b) ? a : b; }
int mmin(int a, int b) { return (a < b) ? a : b; }
int main() {
  int a;
  string s;
  int sum[4001];
  long long count[40001];
  cin >> a;
  cin >> s;
  for (int i = 0; i < (((int)(s).size())); i++) {
    sum[i] = s[i] - '0';
    if (i > 0) sum[i] += sum[i - 1];
  }
  long long zero = 0, nonzero = 0;
  for (int i = 0; i < (40001); i++) count[i] = 0;
  for (int i = 0; i < (((int)(s).size())); i++)
    for (int j = (i); j < (((int)(s).size())); j++) {
      int val = sum[j];
      if (i > 0) val -= sum[i - 1];
      count[val]++;
      if (val == 0)
        zero++;
      else
        nonzero++;
    }
  long long res = 0;
  if (a == 0) {
    res = zero * nonzero * 2LL + zero * zero;
  } else {
    for (int k = 1; k * k <= a; k++) {
      if (a % k) continue;
      if (a / k > sum[((int)(s).size()) - 1]) continue;
      if (k * k == a)
        res += count[k] * count[a / k];
      else
        res += 2LL * count[k] * count[a / k];
    }
  }
  cout << res << endl;
  return 0;
}
