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 print(vector<int> &v) {
  int i;
  for (i = 0; i < (((int)(v).size())); i++) cout << v[i] << " ";
  cout << endl;
  return;
}
int r[4004], rs[4004];
map<int, int> Map;
string s;
int main() {
  int i, j, k, n, m;
  long long ans = 0;
  cin >> m;
  cin >> s;
  n = ((int)(s).size());
  for (i = (1); i <= (n); i++) r[i] = s[i - 1] - '0';
  for (i = (1); i <= (n); i++) rs[i] = rs[i - 1] + r[i];
  for (i = (1); i <= (n); i++) {
    for (j = (i); j <= (n); j++) {
      k = ((rs[j] - rs[i - 1]));
      if ((!m && !k) || (k && m && (m % k == 0))) {
        Map[k]++;
      }
    }
  }
  if (!m) {
    long long c1 = Map[0];
    long long c2 = n * (n + 1) / 2;
    ans = c1 * c2 + c2 * c1 - c1 * c1;
    cout << ans << endl;
    return 0;
  }
  long long k1, k2;
  for (k1 = 1; k1 * k1 <= m; k1++) {
    if (m % k1 == 0) {
      k2 = m / k1;
      long long c1 = Map[k1];
      long long c2 = Map[k2];
      ans += c1 * c2;
      if (k1 != k2) ans += c1 * c2;
    }
  }
  cout << ans << endl;
  return 0;
}
