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 int maxn = 4e3 + 1;
char s[maxn];
int sum[maxn];
long long int t[maxn * 9];
int main() {
  int n;
  scanf("%d", &n);
  scanf("%s", s);
  int sizee = strlen(s);
  for (int i = 1; i < sizee + 1; i++) sum[i] = sum[i - 1] + s[i - 1] - '0';
  for (int i = 1; i < sizee + 1; i++)
    for (int j = 0; j < i; j++) t[sum[i] - sum[j]]++;
  long long int ans = 0;
  if (n == 0) {
    for (int i = 1; i < maxn * 9; i++) ans += t[i];
    ans = ans * 2 * t[0] + t[0] * t[0];
  } else
    for (int i = 1; i < maxn * 9; i++)
      if (n % i == 0 && n / i < maxn * 9) ans += t[i] * t[n / i];
  printf("%I64d", ans);
}
