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 str[5000];
long long sum[5000];
long long partsums[40000];
inline long long partsum(int i, int j) {
  return sum[j] - sum[i] + str[i] - '0';
}
int main() {
  int a, n = 1;
  cin >> a >> str;
  sum[0] = str[0] - '0';
  for (; str[n]; ++n) sum[n] = sum[n - 1] + str[n] - '0';
  long long res = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = i; j < n; ++j) {
      partsums[partsum(i, j)] += 1;
    }
  }
  if (a == 0) {
    if (partsums[0] == 0) {
      cout << 0;
      return 0;
    }
    long long c = 0;
    for (int i = 1; i < 40000; ++i) {
      if (partsums[i]) c += partsums[i];
    }
    cout << 2 * partsums[0] * c + partsums[0] * partsums[0];
    return 0;
  }
  for (int i = 1; i < 40000; ++i) {
    if (partsums[i]) {
      int mul = a / i;
      if (mul > 0 && mul < 40000 && mul * i == a && partsums[mul]) {
        res += partsums[i] * partsums[mul];
      }
    }
  }
  cout << res;
  return 0;
}
