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 inf = ~0U >> 1, maxn = 100000 + 10;
long long a;
long long s[maxn], cnt[maxn];
void setIO(string name) {}
long long gI() {
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  long long p = 0, flag = 1;
  if (c == '-') flag = -1, c = getchar();
  while (c >= '0' && c <= '9') p = p * 10 + c - '0', c = getchar();
  return p * flag;
}
template <class T>
void debug(const T &a, const int &n) {
  for (int i = 0; i < n; ++i) cout << a[i] << " ";
  puts("");
}
int main() {
  setIO("test");
  a = gI();
  char c[5000];
  scanf("%s", c);
  int n = strlen(c);
  for (int i = 0; i < n; ++i) {
    s[i + 1] = s[i] + c[i] - '0';
  }
  memset(cnt, 0, sizeof(cnt));
  for (int i = 1; i <= n; ++i)
    for (int j = 0; j <= i - 1; ++j) {
      ++cnt[s[i] - s[j]];
    }
  long long ans = 0;
  for (int i = 1; i <= 40000; ++i) {
    if (a % i == 0 && a / i < 40000) {
      ans += cnt[i] * cnt[a / i];
    }
  }
  if (a == 0) {
    ans = 0;
    for (int i = 1; i <= 40000; ++i) ans += cnt[i] * cnt[0];
    ans *= 2;
    ans += cnt[0] * cnt[0];
  }
  cout << ans << endl;
  return 0;
}
