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;
void init(long long f[], string s, long n) {
  long a[n + 10];
  for (long i = 1; i <= n; i++) a[i] = ((long)s[i - 1]) - ((long)'0');
  long sum[n + 10];
  sum[0] = 0;
  for (long i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  fill(f, f + n * 9, 0);
  for (long i = 1; i <= n; i++)
    for (long j = i; j <= n; j++) f[sum[j] - sum[i - 1]]++;
}
long long f[36010];
long a;
string s;
int main() {
  cin >> a;
  cin >> s;
  long n = s.length();
  init(f, s, n);
  if (a == 0) {
    long long res = 0;
    res += f[0] * f[0];
    for (int i = 1; i <= n * 9; i++) res += 2 * f[0] * f[i];
    cout << res;
    return 0;
  }
  long long res = 0;
  long m = (long)sqrt(a) + 1;
  for (long i = 1; i < m; i++)
    if (a % i == 0 && i <= n * 9 && a / i <= n * 9) {
      long j = a / i;
      if (i == j)
        res += f[i] * f[i];
      else
        res += 2 * f[i] * f[j];
    }
  cout << res;
  return 0;
}
