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;
const double PI = acos(-1.0);
int sum[4011 * 9];
int val[4011];
int main() {
  long long a;
  cin >> a;
  string s;
  cin >> s;
  int tam = s.size();
  for (int i = 0; i < tam; i++) {
    val[i] = s[i] - '0';
  }
  memset(sum, 0, sizeof(sum));
  int ss = 0;
  for (int i = 0; i < tam; i++) {
    int vv = 0;
    for (int j = i; j < tam; j++) {
      vv += val[j];
      sum[vv]++;
      ss++;
    }
  }
  long long temp = 0;
  long long resp = 0;
  for (int i = 0; i < tam; i++) {
    temp = 0;
    for (int j = i; j < tam; j++) {
      temp += val[j];
      if (temp > 0 && ((a / temp) < 4011 * 9) && a % temp == 0 &&
          sum[a / temp]) {
        resp += sum[a / temp];
      } else if (temp == 0 && a == 0) {
        resp += ss;
      }
    }
  }
  cout << resp << endl;
  return 0;
}
