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 maxn = 1e5 + 100;
int freq[maxn];
void solve() {
  int a, n, k;
  scanf("%d", &a);
  string s;
  cin >> s;
  n = (int)s.size();
  for (int i = 0; i <= n - 1; i++) {
    k = 0;
    for (int j = i; j <= n - 1; j++) {
      int p = s[j] - '0';
      k += p;
      freq[k]++;
    }
  }
  if (!a) {
    printf("%lld\n", 1ll * n * (n + 1) * freq[0] - 1ll * freq[0] * freq[0]);
    return;
  }
  long long int ans = 0;
  for (int i = 1; i <= maxn - 1; i++) {
    if (freq[i] and (!(a % i)) and ((a / i) < maxn)) {
      ans += (1ll * freq[i] * freq[a / i]);
    }
  }
  printf("%lld\n", ans);
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
