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;
int f[1000007], L[4007];
char str[4007];
int N, A, i, j, current;
long long ans;
int main() {
  scanf("%d%s", &A, str);
  N = strlen(str);
  for (i = 1; i <= N; ++i) L[i] = L[i - 1] + (str[i - 1] - '0');
  for (i = 1; i <= N; ++i)
    for (j = i; j <= N; ++j) {
      current = L[j] - L[i - 1];
      if (current == 0) ++f[0];
      if (current == 0 || current > A || A % current != 0 ||
          current > 1000007 - 1)
        continue;
      ++f[current];
    }
  if (A == 0) {
    printf("%I64d\n", 1LL * f[0] * N * (N + 1) - 1LL * f[0] * f[0]);
    return 0;
  }
  for (i = 1; i <= N; ++i)
    for (j = i; j <= N; ++j) {
      current = L[j] - L[i - 1];
      if (current == 0 || current > A || A % current != 0 ||
          A / current > 1000007 - 1)
        continue;
      ans += 1LL * f[A / current];
    }
  printf("%I64d\n", ans);
  return 0;
}
