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 cnt[111111];
long long getCnt(int i) {
  if (i >= 111111 || i < 0) return 0;
  return cnt[i];
}
long long run(int a) {
  long long ans = 0;
  if (a == 0) {
    for (int i = 1; i < 111111; ++i) ans += getCnt(0) * getCnt(i);
    ans *= 2;
    ans += getCnt(0) * getCnt(0);
  } else {
    for (int i = 1; i < 111111; ++i) {
      if (a % i == 0) ans += getCnt(i) * getCnt(a / i);
    }
  }
  return ans;
}
int main() {
  int a, n;
  string inStr;
  cin >> a;
  cin >> inStr;
  n = inStr.length();
  for (int i = 0; i < n; ++i) {
    int sum = 0;
    for (int j = i; j < n; ++j) {
      sum += inStr[j] - '0';
      cnt[sum]++;
    }
  }
  cout << run(a);
  return 0;
}
