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 = 5001;
char s[maxn];
long long a, p[maxn], ans, n, ansa;
map<long long, long long> cnt;
int main() {
  cin >> a;
  scanf("%s", s);
  n = strlen(s);
  for (long long i = 1; i <= n; i++) p[i] = p[i - 1] + s[i - 1] - '0';
  for (long long i = 1; i <= n; i++)
    for (long long j = i; j <= n; j++) cnt[p[j] - p[i - 1]]++;
  for (long long i = 1; i <= n; i++)
    for (long long j = i; j <= n; j++) {
      if (p[j] - p[i - 1] == 0) {
        ansa += (!a ? n * (n + 1) / 2 : 0);
        continue;
      }
      if (p[j] - p[i - 1] == sqrt(a) && (long long)sqrt(a) == sqrt(a + 0.0)) {
        ansa += cnt[(long long)sqrt(a)];
        continue;
      }
      if (a % (p[j] - p[i - 1]) == 0) ans += cnt[a / (p[j] - p[i - 1])];
    }
  cout << ans + ansa;
  return 0;
}
