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;
inline int in() {
  int32_t x;
  scanf("%d", &x);
  return x;
}
inline string get() {
  char ch[1000000];
  scanf("%s", ch);
  return ch;
}
template <class P, class Q>
inline P smin(P &a, Q b) {
  if (b < a) a = b;
  return a;
}
template <class P, class Q>
inline P smax(P &a, Q b) {
  if (a < b) a = b;
  return a;
}
const int MAX_LG = 17;
const long long maxn = 1e6 + 10;
long long cnt[maxn];
long long res, tot;
int32_t main() {
  long long n = in();
  string s = get();
  long long tot = 0;
  for (long long i = 0; i < s.size(); i++) {
    long long sum = 0;
    for (long long j = i; j < s.size(); j++) {
      sum += s[j] - '0';
      cnt[sum]++;
    }
    tot += s[i] - '0';
  }
  for (long long i = 1; i <= tot; i++)
    if (n % i == 0 && n / i < maxn) res += cnt[i] * cnt[n / i];
  if (!n) res = 2 * res + cnt[0] * cnt[0];
  cout << res << "\n";
}
