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 = 2.0 * acos(0.0);
const int MOD = 1e9 + 9;
const int oo = 2e9 + 1e8;
long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); }
const int mx = 9 * 4e3 + 5;
long long a, ans, hve[mx];
char str[mx];
int main() {
  scanf("%I64d%s", &a, str);
  int n = strlen(str);
  for (int i = 0; i < n; i++) {
    long long s = 0;
    for (int j = i; j < n; j++) s += str[j] - '0', ++hve[s];
  }
  if (!a) {
    ans = hve[0] * n * (n + 1) - hve[0] * hve[0];
    goto hell;
  }
  n = min(n * 9LL, a) + 1;
  for (int i = 1; i < n; i++)
    if (a % i == 0 && a / i <= mx - 5) ans += hve[i] * hve[a / i];
hell:
  printf("%I64d\n", ans);
  return 0;
}
