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 inp[4002];
char str[4002];
map<int, int> m;
int main() {
  int a, l, i, j;
  long long int res = (long long int)0;
  scanf("%d%s", &a, str);
  l = strlen(str);
  for (i = 0; i < l; i++) {
    inp[i + 1] = str[i] - '0';
  }
  for (i = 2; i <= l; i++) {
    inp[i] += inp[i - 1];
  }
  for (i = 0; i <= l; i++) {
    for (j = i + 1; j <= l; j++) {
      m[inp[j] - inp[i]]++;
    }
  }
  for (i = 0; i <= l; i++) {
    for (j = i + 1; j <= l; j++) {
      if (a == 0) {
        if (inp[j] - inp[i] == 0) {
          res +=
              2 * (long long int)l * (long long int)(l + 1) / (long long int)2 -
              (long long int)m[0];
        }
      } else {
        if (inp[j] - inp[i] <= a && inp[j] - inp[i] != 0) {
          if (a % (inp[j] - inp[i]) == 0) {
            res += (long long int)m[a / (inp[j] - inp[i])];
          }
        }
      }
    }
  }
  printf("%I64d", res);
}
