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 = 4000 + 10;
char str[MAXN];
int d[MAXN], n, sum[MAXN];
int len;
long long num[10 * MAXN + 10];
bool comp(int a, int b) { return a < b; }
int main() {
  scanf("%d", &n);
  scanf("%s", str);
  len = strlen(str);
  for (int i = 0; i < len; i++) d[i + 1] = str[i] - '0';
  sum[0] = 0;
  d[0] = 0;
  int pp = 0;
  int mm = 0;
  memset(num, 0, sizeof(num));
  for (int i = 1; i <= len; i++) sum[i] = sum[i - 1] + d[i];
  for (int i = 0; i <= len; i++)
    for (int j = i + 1; j <= len; j++) {
      int tmp = sum[j] - sum[i];
      if (!tmp || (!(n % tmp) && tmp)) {
        num[tmp]++;
        if (mm < tmp) mm = tmp;
      }
    }
  if (n == 0) {
    long long res = 0;
    res += (num[0] * num[0]);
    for (int i = 1; i <= mm; i++) res += (2 * num[0] * num[i]);
    cout << res << endl;
  } else {
    long long res = 0;
    for (int i = 1; i <= min(n, mm); i++)
      if (!(n % i) && n / i <= mm) res += num[i] * num[n / i];
    cout << res << endl;
  }
  return 0;
}
