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;
char s[4005];
long long a, n;
long long T[4005];
int main() {
  while (cin >> a) {
    scanf("%s", s);
    n = strlen(s);
    for (int i = 0; i < (n); i++) T[i + 1] = T[i] + s[i] - '0';
    vector<long long> V;
    for (int i = 1; i <= n; ++i)
      for (int j = i; j <= n; ++j) {
        long long sum = T[j] - T[i - 1];
        V.push_back(sum);
      }
    sort(V.begin(), V.end());
    int nV = V.size();
    long long cnt = 0;
    if (a == 0) {
      long long t = upper_bound(V.begin(), V.end(), 0) -
                    lower_bound(V.begin(), V.end(), 0);
      cnt = t * (n * (n + 1) - t);
      cout << cnt << endl;
      continue;
    }
    for (int i = 0; i < (nV); i++)
      if (V[i] > 0 && a % V[i] == 0) {
        long long x = a / V[i];
        cnt += upper_bound(V.begin(), V.end(), x) -
               lower_bound(V.begin(), V.end(), x);
      }
    cout << cnt << endl;
  }
}
