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 arr[40005];
long long cum[40005];
int main() {
  long long i, j, k, l, n, m, t, a;
  string x;
  cin >> a >> x;
  cum[0] = 0;
  for (i = 1; i <= x.size(); i++) cum[i] = cum[i - 1] + x[i - 1] - '0';
  for (i = 1; i <= x.size(); i++) {
    for (j = i; j <= x.size(); j++) {
      arr[cum[j] - cum[i - 1]]++;
    }
  }
  long long ans = 0;
  for (i = 1; i <= 36000; i++) {
    if (a % i == 0 && a / i <= 36000) ans = ans + arr[i] * arr[a / i];
  }
  if (a == 0) {
    cout << (long long)(arr[0] * x.size() * (x.size() + 1) - arr[0] * arr[0])
         << endl;
  } else
    cout << ans << endl;
  return 0;
}
