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;
long long int modpow(long long int a, long long int n, long long int temp) {
  long long int res = 1, y = a;
  while (n > 0) {
    if (n & 1) res = (res * y) % temp;
    y = (y * y) % temp;
    n /= 2;
  }
  return res % temp;
}
char ch[1000006];
long long int val[1000006];
map<long long int, long long int> mapit;
int main() {
  long long int a, i, j, ans = 0, sz, sum;
  scanf("%lld", &a);
  scanf("%s", ch);
  sz = strlen(ch);
  for (i = 0; i < sz; ++i) val[i] = ch[i] - '0';
  for (i = 0; i < sz; ++i) {
    sum = 0;
    for (j = i; j < sz; ++j) {
      sum += val[j];
      mapit[sum]++;
    }
  }
  for (i = 0; i < sz; ++i) {
    sum = 0;
    for (j = i; j < sz; ++j) {
      sum += val[j];
      if (a == 0 && sum == 0) {
        ans += (sz * (sz + 1)) / 2;
      } else if (sum != 0 && a % sum == 0)
        ans += mapit[a / sum];
    }
  }
  printf("%lld\n", ans);
  return 0;
}
