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 =
    3.141592653589793238462643383279502884197169399375105820974944;
int bit[5000];
void update(int x, int val) {
  for (; x < 5000; x += x & -x) bit[x] += val;
}
int query(int x) {
  int sum = 0;
  for (; x > 0; x -= x & -x) sum += bit[x];
  return sum;
}
int main() {
  bit[0] = 0;
  long long a;
  cin >> a;
  string str;
  cin >> str;
  int n = str.length();
  for (int i = 0; i < n; i++) update(i + 1, str[i] - '0');
  vector<long long> cnt(50000, 0);
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) cnt[query(j) - query(i - 1)]++;
  long long ans = 0;
  if (a != 0) {
    for (int i = 1; i < 50000; i++) {
      if (a % i == 0 && a / i < 50000) ans += cnt[i] * cnt[a / i];
    }
  } else {
    ans = 1ll * cnt[0] * (n + 1) * n - cnt[0] * cnt[0];
  }
  cout << ans << endl;
}
