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;
long long nar[4009];
long long pf[4009];
long long mp[40000];
int main() {
  long long a;
  string s;
  cin >> a >> s;
  long long m = s.length();
  for (long long i = 0; i < m; i++) nar[i] = s[i] - '0';
  pf[0] = 0;
  for (long long i = 0; i < m; i++) pf[i + 1] = pf[i] + nar[i];
  for (long long i = 0; i <= m; i++)
    for (long long j = i + 1; j <= m; j++) mp[pf[j] - pf[i]]++;
  long long sm = 0;
  if (a != 0) {
    for (long long i = 0; i <= m; i++)
      for (long long j = i + 1; j <= m; j++)
        if (pf[j] - pf[i] != 0 && a % (pf[j] - pf[i]) == 0 &&
            a / (pf[j] - pf[i]) < 40000)
          sm += mp[a / (pf[j] - pf[i])];
  } else {
    long long tsm = (m + 1) * m / 2;
    long long zrc = 0;
    for (long long i = 0; i <= m; i++)
      for (long long j = i + 1; j <= m; j++)
        if (pf[j] - pf[i] == 0) zrc++;
    sm = zrc * tsm + zrc * tsm - zrc * zrc;
  }
  cout << sm << endl;
  return 0;
}
