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;
string s;
long long count_asduhsahd[40006];
int main(void) {
  int a;
  cin >> a;
  cin >> s;
  long long ans = 0;
  if (a == 0) {
    long long curn = 0;
    vector<long long> nb;
    for (int i = 0; i < s.length(); ++i) {
      if (s[i] != '0') {
        nb.push_back(curn);
        curn = 0;
      } else
        curn++;
    }
    nb.push_back(curn);
    for (int i = 0; i < nb.size(); ++i) {
      ans +=
          (nb[i] * nb[i] + nb[i]) * (s.length() * s.length() + s.length()) / 2;
      for (int j = 0; j < nb.size(); ++j) {
        ans -= (nb[i] * nb[i] + nb[i]) * (nb[j] * nb[j] + nb[j]) / 4;
      }
    }
    cout << ans << endl;
    return 0;
  }
  long long cur = 0;
  count_asduhsahd[0]++;
  for (int i = 0; i < s.length(); ++i) {
    cur += s[i] - '0';
    count_asduhsahd[cur]++;
  }
  long long fmn = 0;
  long long smn = 0;
  long long ai;
  int magic = sqrt((long double)a);
  for (int i = 1; i <= magic; ++i) {
    if (a % i == 0) {
      fmn = 0;
      smn = 0;
      if (a / i <= cur) {
        for (int j = i; j <= cur; ++j) {
          fmn += count_asduhsahd[j] * count_asduhsahd[j - i];
        }
        ai = a / i;
        for (int j = ai; j <= cur; ++j) {
          smn += count_asduhsahd[j] * count_asduhsahd[j - ai];
        }
        ans += (long long)fmn * (long long)smn * 2;
        if (i == ai) ans -= (long long)fmn * (long long)smn;
      }
    }
  }
  cout << ans << endl;
}
