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 gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
const int INF = 1 << 30;
const double eps = 1e-8;
const int row = 3000;
const int cow = 220;
const int MAXN = cow * cow;
int n, m;
long long a[50000];
long long sum[50000];
char s[5000];
int main() {
  int i, j, t;
  long long k;
  cin >> k;
  scanf("%s", &s);
  n = strlen(s);
  sum[0] = 0;
  for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + s[i - 1] - '0';
  memset(a, 0, sizeof(a));
  for (i = 0; i <= n; i++) {
    for (j = i + 1; j <= n; j++) {
      a[sum[j] - sum[i]]++;
    }
  }
  long long ans = 0;
  if (k == 0) {
    ans += (a[0] * a[0]);
    for (i = 1; i < 50000; i++) {
      ans += (a[0] * a[i] * 2);
    }
  } else {
    for (i = 1; i <= 40000; i++) {
      if (k % i == 0 && k / i <= 40000) {
        ans += (a[i] * a[k / i]);
      }
    }
  }
  cout << ans << endl;
  return 0;
}
