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>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int maxN = 5000;
const int maxL = 500000;
int a;
char s[maxN];
int sum[maxN];
int cnt[maxL];
int main() {
  scanf("%d", &a);
  scanf("%s", &s);
  int n = strlen(s);
  for (int i = 0; i < n; ++i) {
    sum[i] = s[i] - '0';
    if (i > 0) {
      sum[i] += sum[i - 1];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = i; j < n; ++j) {
      int t = sum[j] - (i == 0 ? 0 : sum[i - 1]);
      ++cnt[t];
    }
  }
  long long res = 0;
  for (int i = 1; i * i <= a; ++i) {
    if (a % i == 0) {
      int j = a / i;
      long long value = 0;
      if (i < maxL && j < maxL) {
        value = (long long)(cnt[i]) * (long long)(cnt[j]);
      }
      if (i != j) {
        value *= 2LL;
      }
      res += value;
    }
  }
  if (a == 0) {
    for (int j = 1; j < maxL; ++j) {
      res += 2LL * (long long)(cnt[j]) * (long long)(cnt[0]);
    }
    res += (long long)(cnt[0]) * (long long)(cnt[0]);
  }
  cout << res << endl;
  return 0;
}
