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 k, a, len, sum[5000];
char s[5000];
map<int, long long> T;
long long ans;
long long C2(int k) { return (long long)k * (k + 1) / 2; }
int main() {
  scanf("%d", &a);
  scanf("%s", s);
  len = strlen(s);
  sum[0] = 0;
  ans = 0;
  for (int i = 0; i < len; i++) sum[i + 1] = s[i] - '0' + sum[i];
  for (int i = 1; i <= len; i++)
    for (int j = i; j <= len; j++) {
      k = sum[j] - sum[i - 1];
      if (k > a) break;
      if (k == 0 || a % k == 0) {
        if (T.count(k) == 0)
          T[k] = 1;
        else
          T[k]++;
      }
    }
  if (a == 0) {
    if (T.count(0))
      ans = (long long)C2(len) * C2(len) -
            (long long)(C2(len) - T[0]) * (C2(len) - T[0]);
  } else
    for (int i = 1; i <= int(sqrt(a)); i++) {
      if (a % i == 0) {
        if (T.count(i) && T.count(a / i))
          ans += (long long)(T[i]) * (long long)(T[a / i]) * (1 + (i * i != a));
      }
    }
  cout << ans << endl;
  return 0;
}
