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 c[4050];
long long leap[40000];
int main() {
  long long i, j, m, n, ans, k;
  long long a, pre, sum;
  memset(leap, 0, sizeof(leap));
  cin >> a;
  scanf("%s", c);
  int len = strlen(c);
  for (i = 1; i <= len; i++) {
    sum = 0;
    for (j = 0; j < i; j++) {
      sum = sum + c[j] - '0';
    }
    leap[sum]++;
    k = 0;
    for (j = i; j < len; j++) {
      sum = sum - (c[k] - '0');
      k++;
      sum = sum + c[j] - '0';
      leap[sum]++;
    }
  }
  sum = 0;
  if (a > 36000)
    pre = 36000;
  else
    pre = a;
  for (i = 1; i <= pre; i++) {
    if (a % i == 0 && a / i <= 36000) {
      if (leap[a / i] && leap[i]) {
        sum += leap[a / i] * leap[i];
      }
    }
  }
  if (a == 0) sum = leap[0] * len * (len + 1) - leap[0] * leap[0];
  cout << sum << endl;
  return 0;
}
