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 up = 36000;
char s[4005];
long long sum[4005], cnt[up + 5];
int main() {
  int a, cc = -1;
  cc = 2;
  scanf("%d", &a);
  scanf("%s", s);
  long long res = 0;
  long long n = strlen(s);
  for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + s[i] - '0';
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) cnt[sum[j] - sum[i - 1]]++;
  if (a == 0) {
    res = 2 * cnt[0] * (n + 1) * n / 2 - cnt[0] * cnt[0];
  } else {
    for (int i = 1; i <= up; i++)
      if (a % i == 0 && a / i <= up) res += cnt[i] * cnt[a / i];
  }
  cout << res << endl;
  return 0;
}
