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 int c[36001] = {0};
int main() {
  long long int a;
  cin >> a;
  string s;
  cin >> s;
  long long int b[s.size()];
  b[0] = s[0] - '0';
  c[b[0]]++;
  for (int i = 1; i < s.size(); i++) {
    b[i] = b[i - 1] + s[i] - '0';
    c[b[i]]++;
    for (int j = 0; j < i; j++) {
      c[b[i] - b[j]]++;
    }
  }
  int l = s.size() - 1;
  long long int x = 0;
  for (int i = 1; i <= b[l]; i++) {
    if (a % i == 0 && a / i <= b[l]) {
      x = x + c[i] * c[a / i];
    }
  }
  if (a == 0) {
    x = 2 * x + c[0] * c[0];
  }
  cout << x << endl;
  return 0;
}
