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 n;
int a;
string s;
long long int dizi[4003];
map<int, int> m;
int zero = 0;
long long int comb(long long int n) { return n * (n - 1) / 2; }
int main() {
  cin >> a;
  cin >> s;
  n = s.size();
  s = ' ' + s;
  for (int i = 1; i <= n; i++) dizi[i] = dizi[i - 1] + s[i] - '0';
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      long long int sum = dizi[i] - dizi[j - 1];
      if (sum != 0 && a >= sum && a % sum == 0) m[sum]++;
      if (sum == 0) zero++;
    }
  }
  if (a == 0) {
    cout << comb(n + 1) * comb(n + 1) -
                (comb(n + 1) - zero) * (comb(n + 1) - zero)
         << endl;
    return 0;
  }
  long long int c = 0;
  for (map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
    int s = it->first;
    long long int say = it->second;
    c += say * m[a / s];
  }
  cout << c << endl;
  return 0;
}
