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 a, n, ans, A[4444], B[4444];
string S;
map<long long, long long> M;
int main() {
  cin >> a >> S;
  for (int i = 0; i < S.size(); i++) A[i + 1] = S[i] - '0', n = i + 1;
  for (int i = 1; i <= n; i++) {
    B[0] = 0;
    for (int j = 0; i + j <= n; j++) {
      B[j + 1] = B[j] + A[i + j];
      M[B[j + 1]] += 1;
    }
  }
  map<long long, long long>::iterator i;
  for (i = M.begin(); i != M.end(); i++) {
    if ((*i).first == 0 || a % (*i).first == 0) {
      ans += (*i).first ? (*i).second * M[a / (*i).first]
             : a == 0   ? M[0] * (n * (n + 1)) / 2
                        : 0;
    }
  }
  cout << ans << endl;
  return 0;
}
