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;
int a;
string s;
int n;
long long Pref[4005];
long long Sum(int lo, int hi) { return Pref[hi + 1] - Pref[lo]; }
map<long long, int> M;
int main() {
  cin >> a >> s;
  n = (int)s.size();
  for (int i = (int)(0); i < (int)(n); ++i) Pref[i + 1] = Pref[i] + s[i] - '0';
  for (int i = (int)(0); i < (int)(n); ++i)
    for (int j = (int)(0); j < (int)(i + 1); ++j) ++M[Sum(j, i)];
  long long R = 0;
  for (int i = (int)(0); i < (int)(n); ++i)
    for (int j = (int)(0); j < (int)(i + 1); ++j)
      if (Sum(j, i) != 0 && a % Sum(j, i) == 0) R += M[a / Sum(j, i)];
  if (a == 0)
    R = 2 * (long long)M[0] * (n * (n + 1) / 2) - (long long)M[0] * M[0];
  cout << R << endl;
  return 0;
}
