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 dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
int dX[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dY[] = {-1, -1, 0, 1, 1, 1, 0, -1};
char s[4010];
int a, n, v[4010];
int main(void) {
  scanf("%d %s", &a, s);
  n = strlen(s);
  for (int((i)) = (0); ((i)) < ((n)); ((i))++) v[i] = (int)(s[i] - '0');
  map<int, long long> d;
  for (int((i)) = (0); ((i)) < ((n)); ((i))++) {
    int c = 0;
    for (int((j)) = (0); ((j)) < ((n - i)); ((j))++) {
      c += v[i + j];
      d[c]++;
    }
  }
  long long r = 0;
  for (int x = 1; x * x <= a; x++)
    if (a % x == 0) {
      r += d[x] * d[a / x];
      if (x * x < a) r += d[a / x] * d[x];
    }
  if (a == 0)
    r = 2 * d[0] * (long long)n * (long long)(n + 1) / (long long)2 -
        d[0] * d[0];
  cout << r;
  return 0;
}
