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 main(int argc, char *argv[]) {
  int a;
  cin >> a;
  string s;
  cin >> s;
  s = "0" + s;
  int n = s.length();
  vector<long long> sum;
  for (int i = 0; i < int(n); i++) {
    int j = 0;
    if (i != 0) {
      j = sum[(int)(sum).size() - 1];
    }
    sum.push_back(j + s[i] - '0');
  }
  cerr << ".";
  vector<long long> v(40000, 0);
  for (int i = 0; i < int(n); i++)
    for (int j = i + 1; j < n; j++) {
      int k = sum[j] - sum[i];
      v[k]++;
    }
  long long c = 0;
  cerr << ".";
  if (a == 0) {
    long long all = n * (n - 1) / 2;
    c = all * v[0] * 2 - ((long long)v[0]) * v[0];
  } else
    for (int i = 0; i < int(min(a + 1, 40000)); i++) {
      if (i >= 40000) continue;
      if (i != 0 && a % i == 0) {
        if (a / i >= 40000) continue;
        c += v[i] * v[a / i];
      }
    }
  cerr << ".";
  cout << c << endl;
  return 0;
}
