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 long long mod = 1e9 + 7;
const long long INF = 4e18;
const int inf = 2e9;
const int N = 9e6;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
long long a, ans;
char s[4005];
int sum[N], pre[4005];
int main(void) {
  int i, j, n, cur = 0;
  scanf("%d %s", &a, &s[1]);
  n = strlen(&s[1]);
  for (i = 1; i <= n; ++i) pre[i] = s[i] - '0';
  for (i = 1; i <= n; ++i) pre[i] += pre[i - 1];
  for (i = 1; i <= n; ++i)
    for (j = i; j <= n; ++j) sum[cur++] = pre[j] - pre[i - 1];
  sort(sum, sum + cur);
  if (!a) {
    int zero = upper_bound(sum, sum + cur, 0) - sum;
    int non = cur - zero;
    ans += 2LL * zero * non;
    ans += 1LL * zero * zero;
  }
  for (i = 1; i * i <= a; ++i)
    if (a % i == 0) {
      int fakt = (i ? a / i : 0);
      int low = lower_bound(sum, sum + cur, i) - sum;
      int upp = upper_bound(sum, sum + cur, i) - sum;
      int lower = lower_bound(sum, sum + cur, fakt) - sum;
      int upper = upper_bound(sum, sum + cur, fakt) - sum;
      ans += 1LL * (upp - low) * (upper - lower);
      if (i * i != a) ans += 1LL * (upp - low) * (upper - lower);
    }
  cout << ans << endl;
  return 0;
}
