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;
char s[4003];
int c[40004];
int main() {
  int a;
  scanf("%d", &a);
  scanf("%s", s);
  const int n = strlen(s);
  for (int i = 0; i < n; i++) {
    int sum = 0;
    for (int j = i; j < n; j++) {
      sum += s[j] - '0';
      c[sum]++;
    }
  }
  long long ans = 0;
  if (a) {
    for (int i = 1; i < 40004; i++) {
      if (a % i == 0 && a / i < 40004) {
        ans += 1ll * c[i] * c[a / i];
      }
    }
  } else {
    ans += 2ll * c[0] * n * (n + 1) / 2 - 1ll * c[0] * c[0];
  }
  printf("%lld", ans);
  return 0;
}
