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;
long long int x[10000005 + 5], y[10000005], z[10000005], n;
string s, S;
int main() {
  {
    long long int a = 0, b = 0, c = 0, d, diff, e, f, g, i, j, k, l, m, in, mod,
                  loc, p, q, r, u, val, w, t, tc, sz, lo, hi, mid,
                  mn = 2134567891, mx = 0, sum = 0, ans = 0;
    cin >> a >> s;
    l = s.size();
    for (i = 0; i < l; i++) {
      sum = 0;
      for (j = i; j < l; j++) {
        sum += s[j] - 48;
        x[sum]++;
      }
      mx = max(mx, sum);
    }
    if (a == 0) {
      ans = x[0] * x[0];
      for (i = 1; i <= 10000005; i++) ans += 2 * (x[0] * x[i]);
    } else {
      for (i = 1; i <= 10000005; i++) {
        if (a % i == 0 && (a / i) <= 10000005) {
          ans += (x[i] * x[a / i]);
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
